About the Execution of 2023-gold for CO4-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
317.188 | 13636.00 | 21450.00 | 469.20 | FFFFTFFTTFFFFFFF | normal |
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.r571-tall-171734910000007.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 CO4-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910000007
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 116K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 74K 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 CO4-PT-02-LTLCardinality-00
FORMULA_NAME CO4-PT-02-LTLCardinality-01
FORMULA_NAME CO4-PT-02-LTLCardinality-02
FORMULA_NAME CO4-PT-02-LTLCardinality-03
FORMULA_NAME CO4-PT-02-LTLCardinality-04
FORMULA_NAME CO4-PT-02-LTLCardinality-05
FORMULA_NAME CO4-PT-02-LTLCardinality-06
FORMULA_NAME CO4-PT-02-LTLCardinality-07
FORMULA_NAME CO4-PT-02-LTLCardinality-08
FORMULA_NAME CO4-PT-02-LTLCardinality-09
FORMULA_NAME CO4-PT-02-LTLCardinality-10
FORMULA_NAME CO4-PT-02-LTLCardinality-11
FORMULA_NAME CO4-PT-02-LTLCardinality-12
FORMULA_NAME CO4-PT-02-LTLCardinality-13
FORMULA_NAME CO4-PT-02-LTLCardinality-14
FORMULA_NAME CO4-PT-02-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717368540702
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=CO4-PT-02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-06-02 22:49:02] [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 22:49:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:49:02] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-06-02 22:49:02] [INFO ] Transformed 97 places.
[2024-06-02 22:49:02] [INFO ] Transformed 299 transitions.
[2024-06-02 22:49:02] [INFO ] Found NUPN structural information;
[2024-06-02 22:49:02] [INFO ] Parsed PT model containing 97 places and 299 transitions and 1113 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 59 transitions
Reduce redundant transitions removed 59 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-02-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 240/240 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 66 transition count 175
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 66 transition count 175
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 76 place count 66 transition count 161
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 63 transition count 152
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 63 transition count 152
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 61 transition count 146
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 61 transition count 146
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 87 place count 61 transition count 145
Applied a total of 87 rules in 32 ms. Remains 61 /97 variables (removed 36) and now considering 145/240 (removed 95) transitions.
[2024-06-02 22:49:02] [INFO ] Flow matrix only has 111 transitions (discarded 34 similar events)
// Phase 1: matrix 111 rows 61 cols
[2024-06-02 22:49:02] [INFO ] Computed 12 invariants in 11 ms
[2024-06-02 22:49:03] [INFO ] Implicit Places using invariants in 178 ms returned [2, 39, 41, 42]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 204 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/97 places, 145/240 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 144
Applied a total of 2 rules in 3 ms. Remains 56 /57 variables (removed 1) and now considering 144/145 (removed 1) transitions.
[2024-06-02 22:49:03] [INFO ] Flow matrix only has 110 transitions (discarded 34 similar events)
// Phase 1: matrix 110 rows 56 cols
[2024-06-02 22:49:03] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:49:03] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-02 22:49:03] [INFO ] Flow matrix only has 110 transitions (discarded 34 similar events)
[2024-06-02 22:49:03] [INFO ] Invariant cache hit.
[2024-06-02 22:49:03] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-06-02 22:49:03] [INFO ] Implicit Places using invariants and state equation in 84 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 55/97 places, 144/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 377 ms. Remains : 55/97 places, 144/240 transitions.
Support contains 21 out of 55 places after structural reductions.
[2024-06-02 22:49:03] [INFO ] Flatten gal took : 34 ms
[2024-06-02 22:49:03] [INFO ] Flatten gal took : 19 ms
[2024-06-02 22:49:03] [INFO ] Input system was already deterministic with 144 transitions.
Incomplete random walk after 10000 steps, including 8 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Finished Best-First random walk after 3476 steps, including 1 resets, run visited all 3 properties in 13 ms. (steps per millisecond=267 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 9 stabilizing places and 13 stable transitions
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(p0))))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 44 transition count 121
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 44 transition count 121
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 29 place count 44 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 43 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 43 transition count 111
Applied a total of 31 rules in 3 ms. Remains 43 /55 variables (removed 12) and now considering 111/144 (removed 33) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 91 transitions (discarded 20 similar events)
// Phase 1: matrix 91 rows 43 cols
[2024-06-02 22:49:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 91 transitions (discarded 20 similar events)
[2024-06-02 22:49:04] [INFO ] Invariant cache hit.
[2024-06-02 22:49:04] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 91 transitions (discarded 20 similar events)
[2024-06-02 22:49:04] [INFO ] Invariant cache hit.
[2024-06-02 22:49:04] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/55 places, 111/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 43/55 places, 111/144 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 264 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-02-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s18 0) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 42 steps with 0 reset in 3 ms.
FORMULA CO4-PT-02-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-02-LTLCardinality-01 finished in 601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1||G(p0))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Graph (trivial) has 43 edges and 55 vertex of which 18 / 55 are part of one of the 2 SCC in 2 ms
Free SCC test removed 16 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 31 transition count 73
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 31 transition count 73
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 31 transition count 69
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 29 place count 27 transition count 65
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 1 with 2 rules applied. Total rules applied 31 place count 26 transition count 66
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 1 with 13 rules applied. Total rules applied 44 place count 26 transition count 53
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 1 with 2 rules applied. Total rules applied 46 place count 25 transition count 52
Applied a total of 46 rules in 20 ms. Remains 25 /55 variables (removed 30) and now considering 52/144 (removed 92) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 33 transitions (discarded 19 similar events)
// Phase 1: matrix 33 rows 25 cols
[2024-06-02 22:49:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 47 ms returned [14, 15, 16]
Discarding 3 places :
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Implicit Place search using SMT only with invariants took 48 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/55 places, 43/144 transitions.
Graph (trivial) has 19 edges and 22 vertex of which 5 / 22 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 18 transition count 30
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 18 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 17 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 17 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 16 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 16 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 16 transition count 26
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 15 transition count 26
Applied a total of 12 rules in 5 ms. Remains 15 /22 variables (removed 7) and now considering 26/43 (removed 17) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
// Phase 1: matrix 20 rows 15 cols
[2024-06-02 22:49:04] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 20 transitions (discarded 6 similar events)
[2024-06-02 22:49:04] [INFO ] Invariant cache hit.
[2024-06-02 22:49:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/55 places, 26/144 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 114 ms. Remains : 15/55 places, 26/144 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s14 0) (EQ s7 1))) (NEQ s8 1)), p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 2 reset in 1 ms.
FORMULA CO4-PT-02-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-02-LTLCardinality-06 finished in 179 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||G(p1))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Graph (trivial) has 48 edges and 55 vertex of which 18 / 55 are part of one of the 2 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 7 place count 33 transition count 79
Iterating global reduction 0 with 6 rules applied. Total rules applied 13 place count 33 transition count 79
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 17 place count 33 transition count 75
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 27 place count 28 transition count 70
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 1 with 2 rules applied. Total rules applied 29 place count 27 transition count 71
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 1 with 12 rules applied. Total rules applied 41 place count 27 transition count 59
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 1 with 2 rules applied. Total rules applied 43 place count 26 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 44 place count 26 transition count 57
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 1 with 2 rules applied. Total rules applied 46 place count 25 transition count 56
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 25 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 24 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 24 transition count 53
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 1 with 2 rules applied. Total rules applied 52 place count 23 transition count 52
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 23 transition count 51
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 53 place count 23 transition count 50
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 22 transition count 50
Applied a total of 55 rules in 25 ms. Remains 22 /55 variables (removed 33) and now considering 50/144 (removed 94) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 27 transitions (discarded 23 similar events)
// Phase 1: matrix 27 rows 22 cols
[2024-06-02 22:49:04] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 42 ms returned [16, 17, 18, 21]
Discarding 4 places :
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Implicit Place search using SMT only with invariants took 43 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/55 places, 39/144 transitions.
Graph (trivial) has 16 edges and 18 vertex of which 4 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 15 transition count 31
Applied a total of 2 rules in 2 ms. Remains 15 /18 variables (removed 3) and now considering 31/39 (removed 8) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 22 transitions (discarded 9 similar events)
// Phase 1: matrix 22 rows 15 cols
[2024-06-02 22:49:04] [INFO ] Computed 3 invariants in 0 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 22 transitions (discarded 9 similar events)
[2024-06-02 22:49:04] [INFO ] Invariant cache hit.
[2024-06-02 22:49:04] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants and state equation in 43 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 67 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/55 places, 31/144 transitions.
Graph (trivial) has 14 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Applied a total of 1 rules in 1 ms. Remains 12 /14 variables (removed 2) and now considering 23/31 (removed 8) transitions.
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
// Phase 1: matrix 15 rows 12 cols
[2024-06-02 22:49:04] [INFO ] Computed 2 invariants in 0 ms
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-02 22:49:04] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:04] [INFO ] Invariant cache hit.
[2024-06-02 22:49:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:49:04] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 12/55 places, 23/144 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 183 ms. Remains : 12/55 places, 23/144 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s0 0) (EQ s8 1)), p0:(AND (EQ s4 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 12 reset in 148 ms.
Product exploration explored 100000 steps with 2 reset in 90 ms.
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 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
[2024-06-02 22:49:05] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:05] [INFO ] Invariant cache hit.
[2024-06-02 22:49:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-02 22:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:49:05] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-02 22:49:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:49:05] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-06-02 22:49:05] [INFO ] Computed and/alt/rep : 12/26/12 causal constraints (skipped 2 transitions) in 3 ms.
[2024-06-02 22:49:05] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2024-06-02 22:49:05] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:05] [INFO ] Invariant cache hit.
[2024-06-02 22:49:05] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-02 22:49:05] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:05] [INFO ] Invariant cache hit.
[2024-06-02 22:49:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:49:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-02 22:49:05] [INFO ] Redundant transitions in 15 ms returned []
[2024-06-02 22:49:05] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:05] [INFO ] Invariant cache hit.
[2024-06-02 22:49:05] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 12/12 places, 23/23 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 (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
[2024-06-02 22:49:06] [INFO ] Flow matrix only has 15 transitions (discarded 8 similar events)
[2024-06-02 22:49:06] [INFO ] Invariant cache hit.
[2024-06-02 22:49:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-02 22:49:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 22:49:06] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-06-02 22:49:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 22:49:06] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-06-02 22:49:06] [INFO ] Computed and/alt/rep : 12/26/12 causal constraints (skipped 2 transitions) in 1 ms.
[2024-06-02 22:49:06] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 87 ms.
Product exploration explored 100000 steps with 4 reset in 90 ms.
Built C files in :
/tmp/ltsmin14337603522067165071
[2024-06-02 22:49:06] [INFO ] Computing symmetric may disable matrix : 23 transitions.
[2024-06-02 22:49:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:49:06] [INFO ] Computing symmetric may enable matrix : 23 transitions.
[2024-06-02 22:49:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:49:06] [INFO ] Computing Do-Not-Accords matrix : 23 transitions.
[2024-06-02 22:49:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:49:06] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14337603522067165071
Running compilation step : cd /tmp/ltsmin14337603522067165071;'/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 200 ms.
Running link step : cd /tmp/ltsmin14337603522067165071;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin14337603522067165071;'/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/stateBased16388943153688773469.hoa' '--buchi-type=spotba'
LTSmin run took 86 ms.
FORMULA CO4-PT-02-LTLCardinality-07 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-02-LTLCardinality-07 finished in 2022 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(p0)) U G(p1)))))'
Support contains 3 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 43 transition count 118
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 43 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 43 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 42 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 42 transition count 107
Applied a total of 34 rules in 5 ms. Remains 42 /55 variables (removed 13) and now considering 107/144 (removed 37) transitions.
[2024-06-02 22:49:06] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
// Phase 1: matrix 89 rows 42 cols
[2024-06-02 22:49:06] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:49:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 22:49:06] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2024-06-02 22:49:06] [INFO ] Invariant cache hit.
[2024-06-02 22:49:06] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:06] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-06-02 22:49:06] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2024-06-02 22:49:06] [INFO ] Invariant cache hit.
[2024-06-02 22:49:06] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 42/55 places, 107/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 42/55 places, 107/144 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : CO4-PT-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s18 0) (EQ s7 1)), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 118 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 211 steps, including 0 resets, run visited all 4 properties in 16 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 42 /42 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-06-02 22:49:08] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2024-06-02 22:49:08] [INFO ] Invariant cache hit.
[2024-06-02 22:49:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 22:49:08] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2024-06-02 22:49:08] [INFO ] Invariant cache hit.
[2024-06-02 22:49:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:08] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 22:49:08] [INFO ] Flow matrix only has 89 transitions (discarded 18 similar events)
[2024-06-02 22:49:08] [INFO ] Invariant cache hit.
[2024-06-02 22:49:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 42/42 places, 107/107 transitions.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 399 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Finished random walk after 93 steps, including 1 resets, run visited all 4 properties in 4 ms. (steps per millisecond=23 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) p1))), (F (NOT p1)), (F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Stack based approach found an accepted trace after 125 steps with 0 reset with depth 126 and stack size 111 in 0 ms.
FORMULA CO4-PT-02-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CO4-PT-02-LTLCardinality-09 finished in 3309 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((G(F(p2))||p1))))))'
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 45 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 45 transition count 122
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 45 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 43 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 43 transition count 110
Applied a total of 30 rules in 8 ms. Remains 43 /55 variables (removed 12) and now considering 110/144 (removed 34) transitions.
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
// Phase 1: matrix 92 rows 43 cols
[2024-06-02 22:49:10] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:49:10] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
[2024-06-02 22:49:10] [INFO ] Invariant cache hit.
[2024-06-02 22:49:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:10] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 92 transitions (discarded 18 similar events)
[2024-06-02 22:49:10] [INFO ] Invariant cache hit.
[2024-06-02 22:49:10] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 43/55 places, 110/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 166 ms. Remains : 43/55 places, 110/144 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CO4-PT-02-LTLCardinality-10 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 p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s9 0) (EQ s22 1)), p1:(OR (EQ s39 0) (EQ s29 1)), p2:(OR (EQ s39 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 43 ms.
Entered a terminal (fully accepting) state of product in 27 steps with 0 reset in 1 ms.
FORMULA CO4-PT-02-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-02-LTLCardinality-10 finished in 403 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 8 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 47 transition count 122
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 47 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 21 place count 47 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 46 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 46 transition count 114
Applied a total of 23 rules in 4 ms. Remains 46 /55 variables (removed 9) and now considering 114/144 (removed 30) transitions.
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
// Phase 1: matrix 96 rows 46 cols
[2024-06-02 22:49:10] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 22:49:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-02 22:49:10] [INFO ] Invariant cache hit.
[2024-06-02 22:49:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 22:49:10] [INFO ] Flow matrix only has 96 transitions (discarded 18 similar events)
[2024-06-02 22:49:10] [INFO ] Invariant cache hit.
[2024-06-02 22:49:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 46/55 places, 114/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 46/55 places, 114/144 transitions.
Stuttering acceptance computed with spot in 259 ms :[true, (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : CO4-PT-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (EQ s10 0) (EQ s0 1) (EQ s23 0) (EQ s35 1)), p2:(OR (EQ s33 0) (EQ s45 1)), p0:(OR (EQ s15 0) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 76 ms.
Product exploration explored 100000 steps with 0 reset in 149 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Computed a total of 8 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 457 ms. Reduced automaton from 7 states, 19 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 284 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :5
Finished Best-First random walk after 200 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=100 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 15 factoid took 706 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-02-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-02-LTLCardinality-13 finished in 2271 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)))'
Support contains 2 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 144/144 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 43 transition count 118
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 43 transition count 118
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 43 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 41 transition count 104
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 41 transition count 104
Applied a total of 36 rules in 7 ms. Remains 41 /55 variables (removed 14) and now considering 104/144 (removed 40) transitions.
[2024-06-02 22:49:12] [INFO ] Flow matrix only has 88 transitions (discarded 16 similar events)
// Phase 1: matrix 88 rows 41 cols
[2024-06-02 22:49:12] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:49:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 22:49:12] [INFO ] Flow matrix only has 88 transitions (discarded 16 similar events)
[2024-06-02 22:49:12] [INFO ] Invariant cache hit.
[2024-06-02 22:49:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-02 22:49:12] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-02 22:49:12] [INFO ] Flow matrix only has 88 transitions (discarded 16 similar events)
[2024-06-02 22:49:12] [INFO ] Invariant cache hit.
[2024-06-02 22:49:12] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/55 places, 104/144 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 143 ms. Remains : 41/55 places, 104/144 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s20 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 112 steps with 0 reset in 0 ms.
FORMULA CO4-PT-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-02-LTLCardinality-15 finished in 234 ms.
All properties solved by simple procedures.
Total runtime 10451 ms.
BK_STOP 1717368554338
--------------------
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="CO4-PT-02"
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 CO4-PT-02, 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 r571-tall-171734910000007"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-02.tgz
mv CO4-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;