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.r109-tall-171624208500412.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 DES-PT-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208500412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 08:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 73K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333169993

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=DES-PT-05b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-21 23:12:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:12:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:12:51] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-21 23:12:51] [INFO ] Transformed 300 places.
[2024-05-21 23:12:51] [INFO ] Transformed 251 transitions.
[2024-05-21 23:12:51] [INFO ] Found NUPN structural information;
[2024-05-21 23:12:51] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DES-PT-05b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 300 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 298 transition count 251
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 25 place count 275 transition count 228
Iterating global reduction 1 with 23 rules applied. Total rules applied 48 place count 275 transition count 228
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 63 place count 260 transition count 213
Iterating global reduction 1 with 15 rules applied. Total rules applied 78 place count 260 transition count 213
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 89 place count 260 transition count 202
Applied a total of 89 rules in 180 ms. Remains 260 /300 variables (removed 40) and now considering 202/251 (removed 49) transitions.
// Phase 1: matrix 202 rows 260 cols
[2024-05-21 23:12:52] [INFO ] Computed 63 invariants in 15 ms
[2024-05-21 23:12:52] [INFO ] Implicit Places using invariants in 263 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 342 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 259/300 places, 202/251 transitions.
Applied a total of 0 rules in 11 ms. Remains 259 /259 variables (removed 0) and now considering 202/202 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 534 ms. Remains : 259/300 places, 202/251 transitions.
Support contains 26 out of 259 places after structural reductions.
[2024-05-21 23:12:52] [INFO ] Flatten gal took : 41 ms
[2024-05-21 23:12:52] [INFO ] Flatten gal took : 18 ms
[2024-05-21 23:12:52] [INFO ] Input system was already deterministic with 202 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 202 rows 259 cols
[2024-05-21 23:12:52] [INFO ] Computed 62 invariants in 15 ms
[2024-05-21 23:12:52] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-21 23:12:53] [INFO ] [Nat]Absence check using 37 positive place invariants in 12 ms returned sat
[2024-05-21 23:12:53] [INFO ] [Nat]Absence check using 37 positive and 25 generalized place invariants in 13 ms returned sat
[2024-05-21 23:12:53] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-21 23:12:53] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 5 ms to minimize.
[2024-05-21 23:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-21 23:12:53] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 23:12:53] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 202/202 transitions.
Graph (complete) has 481 edges and 259 vertex of which 257 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
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 257 transition count 183
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 34 place count 242 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 241 transition count 182
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 35 place count 241 transition count 171
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 57 place count 230 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 228 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 228 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 228 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 64 place count 227 transition count 167
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 65 place count 226 transition count 166
Iterating global reduction 5 with 1 rules applied. Total rules applied 66 place count 226 transition count 166
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 5 with 2 rules applied. Total rules applied 68 place count 226 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 70 place count 225 transition count 163
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 224 place count 148 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 228 place count 146 transition count 88
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 146 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 230 place count 145 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 231 place count 144 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 232 place count 143 transition count 86
Applied a total of 232 rules in 81 ms. Remains 143 /259 variables (removed 116) and now considering 86/202 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 143/259 places, 86/202 transitions.
Incomplete random walk after 10000 steps, including 452 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 60510 steps, run visited all 1 properties in 178 ms. (steps per millisecond=339 )
Probabilistic random walk after 60510 steps, saw 16256 distinct states, run finished after 178 ms. (steps per millisecond=339 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
FORMULA DES-PT-05b-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 77 stabilizing places and 69 stable transitions
Graph (complete) has 481 edges and 259 vertex of which 253 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(G(p1) U p2))))'
Support contains 6 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Graph (complete) has 481 edges and 259 vertex of which 253 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 183
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 237 transition count 172
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 226 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 225 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 225 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 225 transition count 169
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 224 transition count 169
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 200 place count 153 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 201 place count 153 transition count 97
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 205 place count 151 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 207 place count 149 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 208 place count 148 transition count 100
Applied a total of 208 rules in 42 ms. Remains 148 /259 variables (removed 111) and now considering 100/202 (removed 102) transitions.
// Phase 1: matrix 100 rows 148 cols
[2024-05-21 23:12:53] [INFO ] Computed 58 invariants in 1 ms
[2024-05-21 23:12:54] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 23:12:54] [INFO ] Invariant cache hit.
[2024-05-21 23:12:54] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
[2024-05-21 23:12:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:12:54] [INFO ] Invariant cache hit.
[2024-05-21 23:12:54] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 148/259 places, 100/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 148/259 places, 100/202 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 249 ms :[(AND (NOT p0) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-05b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s82 0) (EQ s25 1)), p2:(OR (EQ s85 0) (EQ s34 1)), p1:(OR (EQ s67 0) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 4 ms.
FORMULA DES-PT-05b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-00 finished in 699 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(G(p0))&&F(p1))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Graph (complete) has 481 edges and 259 vertex of which 253 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 183
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 237 transition count 172
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 226 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 225 transition count 171
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 225 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 225 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 225 transition count 169
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 224 transition count 169
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 206 place count 150 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 150 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
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 211 place count 148 transition count 99
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 146 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 214 place count 145 transition count 97
Applied a total of 214 rules in 46 ms. Remains 145 /259 variables (removed 114) and now considering 97/202 (removed 105) transitions.
// Phase 1: matrix 97 rows 145 cols
[2024-05-21 23:12:54] [INFO ] Computed 58 invariants in 2 ms
[2024-05-21 23:12:54] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-21 23:12:54] [INFO ] Invariant cache hit.
[2024-05-21 23:12:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-21 23:12:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-21 23:12:54] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:12:54] [INFO ] Invariant cache hit.
[2024-05-21 23:12:54] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/259 places, 97/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 383 ms. Remains : 145/259 places, 97/202 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s61 0) (EQ s21 1)), p1:(OR (EQ s27 0) (EQ s38 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 81 steps with 0 reset in 4 ms.
FORMULA DES-PT-05b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-01 finished in 513 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 1 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Graph (complete) has 481 edges and 259 vertex of which 253 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 252 transition count 183
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 237 transition count 183
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 237 transition count 171
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 225 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 223 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 223 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 223 transition count 168
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 60 place count 223 transition count 167
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 62 place count 222 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 221 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 221 transition count 166
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 3 with 2 rules applied. Total rules applied 66 place count 221 transition count 164
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 68 place count 220 transition count 163
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 220 place count 144 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 224 place count 142 transition count 89
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 140 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 139 transition count 87
Applied a total of 227 rules in 43 ms. Remains 139 /259 variables (removed 120) and now considering 87/202 (removed 115) transitions.
// Phase 1: matrix 87 rows 139 cols
[2024-05-21 23:12:55] [INFO ] Computed 58 invariants in 3 ms
[2024-05-21 23:12:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:12:55] [INFO ] Invariant cache hit.
[2024-05-21 23:12:55] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-21 23:12:55] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:12:55] [INFO ] Invariant cache hit.
[2024-05-21 23:12:55] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/259 places, 87/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 139/259 places, 87/202 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05b-LTLCardinality-03 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:(EQ s103 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 2 ms.
FORMULA DES-PT-05b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-03 finished in 443 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)||G(p1))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Graph (complete) has 481 edges and 259 vertex of which 257 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 256 transition count 187
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 244 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 243 transition count 186
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 27 place count 243 transition count 175
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 49 place count 232 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 51 place count 230 transition count 173
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 230 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 230 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 56 place count 229 transition count 171
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 57 place count 228 transition count 170
Iterating global reduction 5 with 1 rules applied. Total rules applied 58 place count 228 transition count 170
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 5 with 2 rules applied. Total rules applied 60 place count 228 transition count 168
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 62 place count 227 transition count 167
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 7 with 154 rules applied. Total rules applied 216 place count 150 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 218 place count 149 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 220 place count 147 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 221 place count 146 transition count 88
Applied a total of 221 rules in 43 ms. Remains 146 /259 variables (removed 113) and now considering 88/202 (removed 114) transitions.
// Phase 1: matrix 88 rows 146 cols
[2024-05-21 23:12:55] [INFO ] Computed 61 invariants in 2 ms
[2024-05-21 23:12:55] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:12:55] [INFO ] Invariant cache hit.
[2024-05-21 23:12:55] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-21 23:12:55] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:12:55] [INFO ] Invariant cache hit.
[2024-05-21 23:12:55] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/259 places, 88/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 146/259 places, 88/202 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-05b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s53 1) (EQ s0 0) (EQ s22 1)), p1:(EQ s25 1)], nbAcceptance=2, 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 4581 reset in 340 ms.
Product exploration explored 100000 steps with 4514 reset in 313 ms.
Computed a total of 39 stabilizing places and 31 stable transitions
Graph (complete) has 441 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 452 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 23:12:56] [INFO ] Invariant cache hit.
[2024-05-21 23:12:56] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:12:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:12:56] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 7 ms returned sat
[2024-05-21 23:12:56] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:12:57] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-21 23:12:57] [INFO ] After 141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 88/88 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 146 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 145 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 145 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 144 transition count 85
Applied a total of 5 rules in 9 ms. Remains 144 /146 variables (removed 2) and now considering 85/88 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 144/146 places, 85/88 transitions.
Incomplete random walk after 10000 steps, including 433 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1231195 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :{}
Probabilistic random walk after 1231195 steps, saw 193300 distinct states, run finished after 3002 ms. (steps per millisecond=410 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 85 rows 144 cols
[2024-05-21 23:13:00] [INFO ] Computed 62 invariants in 5 ms
[2024-05-21 23:13:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-21 23:13:00] [INFO ] [Nat]Absence check using 37 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 23:13:00] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:00] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 23:13:00] [INFO ] After 118ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 144/144 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-21 23:13:00] [INFO ] Invariant cache hit.
[2024-05-21 23:13:00] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 23:13:00] [INFO ] Invariant cache hit.
[2024-05-21 23:13:00] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-21 23:13:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:00] [INFO ] Invariant cache hit.
[2024-05-21 23:13:00] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 23:13:00] [INFO ] Invariant cache hit.
[2024-05-21 23:13:00] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:00] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-21 23:13:00] [INFO ] [Nat]Absence check using 37 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 23:13:00] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:00] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-21 23:13:00] [INFO ] After 146ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 144 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 88/88 transitions.
Applied a total of 0 rules in 7 ms. Remains 146 /146 variables (removed 0) and now considering 88/88 (removed 0) transitions.
// Phase 1: matrix 88 rows 146 cols
[2024-05-21 23:13:01] [INFO ] Computed 61 invariants in 3 ms
[2024-05-21 23:13:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-21 23:13:01] [INFO ] Invariant cache hit.
[2024-05-21 23:13:01] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-21 23:13:01] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 23:13:01] [INFO ] Invariant cache hit.
[2024-05-21 23:13:01] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 146/146 places, 88/88 transitions.
Computed a total of 39 stabilizing places and 31 stable transitions
Graph (complete) has 441 edges and 146 vertex of which 142 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 84 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 461 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-21 23:13:01] [INFO ] Invariant cache hit.
[2024-05-21 23:13:01] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-21 23:13:01] [INFO ] [Nat]Absence check using 35 positive and 26 generalized place invariants in 6 ms returned sat
[2024-05-21 23:13:01] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:01] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-21 23:13:01] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 88/88 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 146 transition count 87
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 145 transition count 86
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 145 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 144 transition count 85
Applied a total of 5 rules in 9 ms. Remains 144 /146 variables (removed 2) and now considering 85/88 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 144/146 places, 85/88 transitions.
Incomplete random walk after 10000 steps, including 437 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 101 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1023411 steps, run timeout after 3001 ms. (steps per millisecond=341 ) properties seen :{}
Probabilistic random walk after 1023411 steps, saw 159864 distinct states, run finished after 3001 ms. (steps per millisecond=341 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 85 rows 144 cols
[2024-05-21 23:13:05] [INFO ] Computed 62 invariants in 2 ms
[2024-05-21 23:13:05] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-21 23:13:05] [INFO ] [Nat]Absence check using 37 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 23:13:05] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:05] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-21 23:13:05] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 18 ms.
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 144/144 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-21 23:13:05] [INFO ] Invariant cache hit.
[2024-05-21 23:13:05] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-21 23:13:05] [INFO ] Invariant cache hit.
[2024-05-21 23:13:05] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-21 23:13:05] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 23:13:05] [INFO ] Invariant cache hit.
[2024-05-21 23:13:05] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 144/144 places, 85/85 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-21 23:13:05] [INFO ] Invariant cache hit.
[2024-05-21 23:13:05] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-21 23:13:05] [INFO ] [Nat]Absence check using 37 positive place invariants in 5 ms returned sat
[2024-05-21 23:13:05] [INFO ] [Nat]Absence check using 37 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 23:13:05] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-21 23:13:05] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-21 23:13:05] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 134 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4556 reset in 236 ms.
Product exploration explored 100000 steps with 4536 reset in 245 ms.
Built C files in :
/tmp/ltsmin7920260847698840508
[2024-05-21 23:13:06] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-21 23:13:06] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:06] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-21 23:13:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:06] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-21 23:13:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 23:13:06] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7920260847698840508
Running compilation step : cd /tmp/ltsmin7920260847698840508;'/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 306 ms.
Running link step : cd /tmp/ltsmin7920260847698840508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7920260847698840508;'/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/stateBased6061254557356787575.hoa' '--buchi-type=spotba'
LTSmin run took 937 ms.
FORMULA DES-PT-05b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05b-LTLCardinality-04 finished in 12320 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(G(p1))))))'
Support contains 2 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 258 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 255 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 254 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 253 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 253 transition count 194
Applied a total of 14 rules in 14 ms. Remains 253 /259 variables (removed 6) and now considering 194/202 (removed 8) transitions.
// Phase 1: matrix 194 rows 253 cols
[2024-05-21 23:13:07] [INFO ] Computed 61 invariants in 6 ms
[2024-05-21 23:13:07] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-21 23:13:07] [INFO ] Invariant cache hit.
[2024-05-21 23:13:08] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-21 23:13:08] [INFO ] Invariant cache hit.
[2024-05-21 23:13:08] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/259 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 462 ms. Remains : 253/259 places, 194/202 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(AND (EQ s196 0) (EQ s230 1)), p1:(OR (EQ s230 0) (EQ s196 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 627 steps with 4 reset in 5 ms.
FORMULA DES-PT-05b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-07 finished in 664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 258 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 255 transition count 199
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 255 transition count 198
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 254 transition count 197
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 254 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 11 place count 254 transition count 196
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 12 place count 253 transition count 195
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 253 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 253 transition count 194
Applied a total of 14 rules in 19 ms. Remains 253 /259 variables (removed 6) and now considering 194/202 (removed 8) transitions.
[2024-05-21 23:13:08] [INFO ] Invariant cache hit.
[2024-05-21 23:13:08] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 23:13:08] [INFO ] Invariant cache hit.
[2024-05-21 23:13:08] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-21 23:13:08] [INFO ] Invariant cache hit.
[2024-05-21 23:13:08] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 253/259 places, 194/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 253/259 places, 194/202 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-05b-LTLCardinality-08 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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (NEQ s77 0) (NEQ s9 1)), p0:(AND (NEQ s221 0) (NEQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA DES-PT-05b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-08 finished in 671 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 259/259 places, 202/202 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 258 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 256 transition count 200
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 256 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 255 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 255 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 255 transition count 198
Applied a total of 8 rules in 13 ms. Remains 255 /259 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 255 cols
[2024-05-21 23:13:09] [INFO ] Computed 61 invariants in 4 ms
[2024-05-21 23:13:09] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-21 23:13:09] [INFO ] Invariant cache hit.
[2024-05-21 23:13:09] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-21 23:13:09] [INFO ] Invariant cache hit.
[2024-05-21 23:13:09] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 255/259 places, 198/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 255/259 places, 198/202 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-05b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s46 1)), p1:(OR (EQ s96 0) (EQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 23975 steps with 220 reset in 58 ms.
FORMULA DES-PT-05b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05b-LTLCardinality-11 finished in 733 ms.
All properties solved by simple procedures.
Total runtime 18350 ms.

BK_STOP 1716333190778

--------------------
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="DES-PT-05b"
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 DES-PT-05b, 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 r109-tall-171624208500412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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