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.r597-smll-171734926400042.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 MedleyA-PT-09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 99K Jun 2 16:33 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 MedleyA-PT-09-LTLCardinality-00
FORMULA_NAME MedleyA-PT-09-LTLCardinality-01
FORMULA_NAME MedleyA-PT-09-LTLCardinality-02
FORMULA_NAME MedleyA-PT-09-LTLCardinality-03
FORMULA_NAME MedleyA-PT-09-LTLCardinality-04
FORMULA_NAME MedleyA-PT-09-LTLCardinality-05
FORMULA_NAME MedleyA-PT-09-LTLCardinality-06
FORMULA_NAME MedleyA-PT-09-LTLCardinality-07
FORMULA_NAME MedleyA-PT-09-LTLCardinality-08
FORMULA_NAME MedleyA-PT-09-LTLCardinality-09
FORMULA_NAME MedleyA-PT-09-LTLCardinality-10
FORMULA_NAME MedleyA-PT-09-LTLCardinality-11
FORMULA_NAME MedleyA-PT-09-LTLCardinality-12
FORMULA_NAME MedleyA-PT-09-LTLCardinality-13
FORMULA_NAME MedleyA-PT-09-LTLCardinality-14
FORMULA_NAME MedleyA-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717362086337

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=MedleyA-PT-09
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 21:01:29] [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-06-02 21:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:01:29] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-06-02 21:01:29] [INFO ] Transformed 147 places.
[2024-06-02 21:01:29] [INFO ] Transformed 315 transitions.
[2024-06-02 21:01:29] [INFO ] Found NUPN structural information;
[2024-06-02 21:01:29] [INFO ] Parsed PT model containing 147 places and 315 transitions and 1583 arcs in 239 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-09-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 313/313 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 143 transition count 313
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 29 place count 116 transition count 283
Iterating global reduction 1 with 27 rules applied. Total rules applied 56 place count 116 transition count 283
Applied a total of 56 rules in 40 ms. Remains 116 /145 variables (removed 29) and now considering 283/313 (removed 30) transitions.
// Phase 1: matrix 283 rows 116 cols
[2024-06-02 21:01:29] [INFO ] Computed 10 invariants in 18 ms
[2024-06-02 21:01:30] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-06-02 21:01:30] [INFO ] Invariant cache hit.
[2024-06-02 21:01:30] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-06-02 21:01:30] [INFO ] Invariant cache hit.
[2024-06-02 21:01:30] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 64 transitions.
Found 64 dead transitions using SMT.
Drop transitions removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in LTL mode, iteration 1 : 116/145 places, 219/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1001 ms. Remains : 116/145 places, 219/313 transitions.
Support contains 27 out of 116 places after structural reductions.
[2024-06-02 21:01:30] [INFO ] Flatten gal took : 82 ms
[2024-06-02 21:01:30] [INFO ] Flatten gal took : 30 ms
[2024-06-02 21:01:31] [INFO ] Input system was already deterministic with 219 transitions.
Incomplete random walk after 10000 steps, including 325 resets, run finished after 661 ms. (steps per millisecond=15 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 219 rows 116 cols
[2024-06-02 21:01:32] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 21:01:32] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:01:32] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 7 ms returned sat
[2024-06-02 21:01:32] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 21:01:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-02 21:01:32] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2024-06-02 21:01:32] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 21:01:32] [INFO ] After 326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-06-02 21:01:32] [INFO ] After 556ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 4 properties in 40 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 219/219 transitions.
Graph (complete) has 395 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 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 21 rules applied. Total rules applied 22 place count 114 transition count 196
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 24 rules applied. Total rules applied 46 place count 94 transition count 192
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 50 place count 92 transition count 190
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 50 place count 92 transition count 185
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 60 place count 87 transition count 185
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 70 place count 77 transition count 171
Iterating global reduction 3 with 10 rules applied. Total rules applied 80 place count 77 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 80 place count 77 transition count 170
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 76 transition count 170
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 45 rules applied. Total rules applied 127 place count 53 transition count 146
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 129 place count 53 transition count 144
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 52 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 52 transition count 142
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 143 place count 46 transition count 166
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 153 place count 46 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 157 place count 44 transition count 179
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 160 place count 44 transition count 176
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 163 place count 41 transition count 176
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 165 place count 41 transition count 174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 167 place count 39 transition count 174
Applied a total of 167 rules in 109 ms. Remains 39 /116 variables (removed 77) and now considering 174/219 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 39/116 places, 174/219 transitions.
Finished random walk after 1684 steps, including 385 resets, run visited all 2 properties in 33 ms. (steps per millisecond=51 )
Parikh walk visited 0 properties in 0 ms.
FORMULA MedleyA-PT-09-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 17 stable transitions
Graph (complete) has 395 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 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' '!(X(((G(((X(p1) U p2)&&p3)) U p4)&&p0)))'
Support contains 7 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 108 transition count 210
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 108 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 107 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 107 transition count 208
Applied a total of 18 rules in 13 ms. Remains 107 /116 variables (removed 9) and now considering 208/219 (removed 11) transitions.
// Phase 1: matrix 208 rows 107 cols
[2024-06-02 21:01:33] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:01:33] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-02 21:01:33] [INFO ] Invariant cache hit.
[2024-06-02 21:01:33] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2024-06-02 21:01:33] [INFO ] Invariant cache hit.
[2024-06-02 21:01:33] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/116 places, 208/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 107/116 places, 208/219 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 508 ms :[(OR (NOT p0) (NOT p4)), (OR (NOT p0) (NOT p4)), true, (OR (NOT p1) (NOT p2)), (OR (NOT p3) (NOT p2)), (NOT p4)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p4) (NOT p3))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p4) p3 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p4) p3), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p4) p3 (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p4) p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s86 0) (EQ s71 1)), p4:(OR (EQ s37 0) (EQ s46 1)), p3:(EQ s44 1), p2:(AND (EQ s44 1) (OR (EQ s50 0) (EQ s34 1))), p1:(OR (EQ s50 0) (EQ s34 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-09-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-01 finished in 1114 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(G((F(p1)&&p0)))))'
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 106 transition count 207
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 106 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 105 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 105 transition count 205
Applied a total of 22 rules in 14 ms. Remains 105 /116 variables (removed 11) and now considering 205/219 (removed 14) transitions.
// Phase 1: matrix 205 rows 105 cols
[2024-06-02 21:01:34] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:01:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 21:01:34] [INFO ] Invariant cache hit.
[2024-06-02 21:01:34] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-06-02 21:01:34] [INFO ] Invariant cache hit.
[2024-06-02 21:01:34] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 105/116 places, 205/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 105/116 places, 205/219 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s33 0) (EQ s49 1)), p1:(OR (EQ s49 0) (EQ s33 1) (EQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-09-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-05 finished in 755 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))'
Support contains 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Graph (complete) has 395 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 113 transition count 198
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 22 rules applied. Total rules applied 41 place count 95 transition count 194
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 93 transition count 191
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 92 transition count 191
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 47 place count 92 transition count 185
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 59 place count 86 transition count 185
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 69 place count 76 transition count 172
Iterating global reduction 4 with 10 rules applied. Total rules applied 79 place count 76 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 79 place count 76 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 83 place count 74 transition count 170
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 127 place count 51 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 51 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 50 transition count 143
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 50 transition count 143
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 145 place count 43 transition count 174
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 159 place count 43 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
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 161 place count 42 transition count 172
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 162 place count 41 transition count 171
Applied a total of 162 rules in 74 ms. Remains 41 /116 variables (removed 75) and now considering 171/219 (removed 48) transitions.
// Phase 1: matrix 171 rows 41 cols
[2024-06-02 21:01:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:01:35] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-02 21:01:35] [INFO ] Invariant cache hit.
[2024-06-02 21:01:35] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-06-02 21:01:35] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-06-02 21:01:35] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 21:01:35] [INFO ] Invariant cache hit.
[2024-06-02 21:01:35] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/116 places, 171/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 435 ms. Remains : 41/116 places, 171/219 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s14 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-06 finished in 494 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(((F(p1) U p2)&&p0))))'
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Graph (complete) has 395 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 114 transition count 200
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 97 transition count 198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 39 place count 96 transition count 197
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 39 place count 96 transition count 191
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 51 place count 90 transition count 191
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 62 place count 79 transition count 176
Iterating global reduction 3 with 11 rules applied. Total rules applied 73 place count 79 transition count 176
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 73 place count 79 transition count 174
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 77 transition count 174
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 37 rules applied. Total rules applied 114 place count 58 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 58 transition count 154
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 116 place count 57 transition count 152
Iterating global reduction 4 with 1 rules applied. Total rules applied 117 place count 57 transition count 152
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 127 place count 52 transition count 177
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 145 place count 52 transition count 159
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 52 transition count 157
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 149 place count 50 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 149 place count 50 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 153 place count 48 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 155 place count 47 transition count 167
Applied a total of 155 rules in 56 ms. Remains 47 /116 variables (removed 69) and now considering 167/219 (removed 52) transitions.
// Phase 1: matrix 167 rows 47 cols
[2024-06-02 21:01:35] [INFO ] Computed 9 invariants in 1 ms
[2024-06-02 21:01:35] [INFO ] Implicit Places using invariants in 61 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/116 places, 167/219 transitions.
Applied a total of 0 rules in 6 ms. Remains 46 /46 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127 ms. Remains : 46/116 places, 167/219 transitions.
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s27 0) (EQ s5 1)), p2:(EQ s8 1), p1:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-09-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-08 finished in 293 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 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Graph (complete) has 395 edges and 116 vertex of which 114 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 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 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 113 transition count 197
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 94 transition count 194
Reduce places removed 1 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 2 with 3 rules applied. Total rules applied 45 place count 93 transition count 192
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 47 place count 92 transition count 191
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 47 place count 92 transition count 185
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 59 place count 86 transition count 185
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 70 place count 75 transition count 170
Iterating global reduction 4 with 11 rules applied. Total rules applied 81 place count 75 transition count 170
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 81 place count 75 transition count 168
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 85 place count 73 transition count 168
Performed 19 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 125 place count 52 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 127 place count 52 transition count 145
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 51 transition count 143
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 51 transition count 143
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 141 place count 45 transition count 167
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 151 place count 45 transition count 157
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -23
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 155 place count 43 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 42 transition count 179
Applied a total of 156 rules in 61 ms. Remains 42 /116 variables (removed 74) and now considering 179/219 (removed 40) transitions.
// Phase 1: matrix 179 rows 42 cols
[2024-06-02 21:01:36] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 21:01:36] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 21:01:36] [INFO ] Invariant cache hit.
[2024-06-02 21:01:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-02 21:01:36] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-06-02 21:01:36] [INFO ] Redundant transitions in 7 ms returned []
[2024-06-02 21:01:36] [INFO ] Invariant cache hit.
[2024-06-02 21:01:36] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/116 places, 179/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 463 ms. Remains : 42/116 places, 179/219 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-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:(OR (EQ s30 0) (EQ 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]]
Product exploration explored 100000 steps with 15823 reset in 511 ms.
Product exploration explored 100000 steps with 15897 reset in 471 ms.
Computed a total of 8 stabilizing places and 101 stable transitions
Computed a total of 8 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 42 /42 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-02 21:01:38] [INFO ] Invariant cache hit.
[2024-06-02 21:01:38] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 21:01:38] [INFO ] Invariant cache hit.
[2024-06-02 21:01:38] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-06-02 21:01:38] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 21:01:38] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 21:01:38] [INFO ] Invariant cache hit.
[2024-06-02 21:01:38] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 386 ms. Remains : 42/42 places, 179/179 transitions.
Computed a total of 8 stabilizing places and 101 stable transitions
Computed a total of 8 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 174 steps, including 25 resets, run visited all 1 properties in 2 ms. (steps per millisecond=87 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 15897 reset in 332 ms.
Product exploration explored 100000 steps with 15924 reset in 448 ms.
Built C files in :
/tmp/ltsmin14097051928898051209
[2024-06-02 21:01:39] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2024-06-02 21:01:39] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:39] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2024-06-02 21:01:39] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:39] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2024-06-02 21:01:39] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:39] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14097051928898051209
Running compilation step : cd /tmp/ltsmin14097051928898051209;'/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 954 ms.
Running link step : cd /tmp/ltsmin14097051928898051209;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin14097051928898051209;'/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/stateBased16944801659144776505.hoa' '--buchi-type=spotba'
LTSmin run took 5502 ms.
FORMULA MedleyA-PT-09-LTLCardinality-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLCardinality-09 finished in 10388 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 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 109 transition count 211
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 109 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 108 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 108 transition count 209
Applied a total of 16 rules in 7 ms. Remains 108 /116 variables (removed 8) and now considering 209/219 (removed 10) transitions.
// Phase 1: matrix 209 rows 108 cols
[2024-06-02 21:01:46] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 21:01:46] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:01:46] [INFO ] Invariant cache hit.
[2024-06-02 21:01:46] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2024-06-02 21:01:46] [INFO ] Invariant cache hit.
[2024-06-02 21:01:46] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 108/116 places, 209/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 479 ms. Remains : 108/116 places, 209/219 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s30 0) (EQ s10 1)) (AND (EQ s89 0) (EQ s52 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 54812 steps with 6189 reset in 99 ms.
FORMULA MedleyA-PT-09-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-09-LTLCardinality-10 finished in 686 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 2 out of 116 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 116/116 places, 219/219 transitions.
Graph (complete) has 395 edges and 116 vertex of which 114 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 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 113 transition count 198
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 1 with 22 rules applied. Total rules applied 41 place count 95 transition count 194
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 45 place count 93 transition count 192
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 93 transition count 187
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 88 transition count 187
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 66 place count 77 transition count 172
Iterating global reduction 3 with 11 rules applied. Total rules applied 77 place count 77 transition count 172
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 77 place count 77 transition count 170
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 75 transition count 170
Performed 20 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 123 place count 53 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 125 place count 53 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 126 place count 52 transition count 144
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 52 transition count 144
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 139 place count 46 transition count 177
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 148 place count 46 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 45 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 152 place count 44 transition count 179
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 153 place count 44 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 43 transition count 178
Applied a total of 154 rules in 51 ms. Remains 43 /116 variables (removed 73) and now considering 178/219 (removed 41) transitions.
// Phase 1: matrix 178 rows 43 cols
[2024-06-02 21:01:47] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 21:01:47] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:01:47] [INFO ] Invariant cache hit.
[2024-06-02 21:01:47] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:01:47] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-06-02 21:01:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-06-02 21:01:47] [INFO ] Invariant cache hit.
[2024-06-02 21:01:47] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/116 places, 178/219 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 409 ms. Remains : 43/116 places, 178/219 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-09-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s26 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13914 reset in 351 ms.
Product exploration explored 100000 steps with 13976 reset in 384 ms.
Computed a total of 8 stabilizing places and 100 stable transitions
Computed a total of 8 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 13 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-06-02 21:01:48] [INFO ] Invariant cache hit.
[2024-06-02 21:01:48] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-06-02 21:01:48] [INFO ] Invariant cache hit.
[2024-06-02 21:01:48] [INFO ] State equation strengthened by 94 read => feed constraints.
[2024-06-02 21:01:48] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-06-02 21:01:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-06-02 21:01:48] [INFO ] Invariant cache hit.
[2024-06-02 21:01:49] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 43/43 places, 178/178 transitions.
Computed a total of 8 stabilizing places and 100 stable transitions
Computed a total of 8 stabilizing places and 100 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Finished random walk after 361 steps, including 48 resets, run visited all 1 properties in 3 ms. (steps per millisecond=120 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 14011 reset in 300 ms.
Product exploration explored 100000 steps with 14050 reset in 316 ms.
Built C files in :
/tmp/ltsmin2357806240595477726
[2024-06-02 21:01:50] [INFO ] Computing symmetric may disable matrix : 178 transitions.
[2024-06-02 21:01:50] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:50] [INFO ] Computing symmetric may enable matrix : 178 transitions.
[2024-06-02 21:01:50] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:50] [INFO ] Computing Do-Not-Accords matrix : 178 transitions.
[2024-06-02 21:01:50] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 21:01:50] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2357806240595477726
Running compilation step : cd /tmp/ltsmin2357806240595477726;'/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 640 ms.
Running link step : cd /tmp/ltsmin2357806240595477726;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2357806240595477726;'/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/stateBased9774056814795533188.hoa' '--buchi-type=spotba'
LTSmin run took 323 ms.
FORMULA MedleyA-PT-09-LTLCardinality-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-09-LTLCardinality-11 finished in 4010 ms.
All properties solved by simple procedures.
Total runtime 21967 ms.

BK_STOP 1717362112506

--------------------
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="MedleyA-PT-09"
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 MedleyA-PT-09, 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 r597-smll-171734926400042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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