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.r395-smll-171683824300257.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 SmartHome-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683824300257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.8K 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 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:43 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 SmartHome-PT-10-LTLCardinality-00
FORMULA_NAME SmartHome-PT-10-LTLCardinality-01
FORMULA_NAME SmartHome-PT-10-LTLCardinality-02
FORMULA_NAME SmartHome-PT-10-LTLCardinality-03
FORMULA_NAME SmartHome-PT-10-LTLCardinality-04
FORMULA_NAME SmartHome-PT-10-LTLCardinality-05
FORMULA_NAME SmartHome-PT-10-LTLCardinality-06
FORMULA_NAME SmartHome-PT-10-LTLCardinality-07
FORMULA_NAME SmartHome-PT-10-LTLCardinality-08
FORMULA_NAME SmartHome-PT-10-LTLCardinality-09
FORMULA_NAME SmartHome-PT-10-LTLCardinality-10
FORMULA_NAME SmartHome-PT-10-LTLCardinality-11
FORMULA_NAME SmartHome-PT-10-LTLCardinality-12
FORMULA_NAME SmartHome-PT-10-LTLCardinality-13
FORMULA_NAME SmartHome-PT-10-LTLCardinality-14
FORMULA_NAME SmartHome-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716978801662

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=SmartHome-PT-10
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-29 10:33:24] [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-29 10:33:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:33:25] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2024-05-29 10:33:25] [INFO ] Transformed 273 places.
[2024-05-29 10:33:25] [INFO ] Transformed 308 transitions.
[2024-05-29 10:33:25] [INFO ] Found NUPN structural information;
[2024-05-29 10:33:25] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 179 transition count 209
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 179 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 110 place count 179 transition count 207
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 118 place count 171 transition count 199
Iterating global reduction 1 with 8 rules applied. Total rules applied 126 place count 171 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 133 place count 164 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 140 place count 164 transition count 192
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 161 transition count 189
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 161 transition count 189
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 160 transition count 188
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 160 transition count 188
Applied a total of 148 rules in 147 ms. Remains 160 /233 variables (removed 73) and now considering 188/263 (removed 75) transitions.
// Phase 1: matrix 188 rows 160 cols
[2024-05-29 10:33:25] [INFO ] Computed 12 invariants in 17 ms
[2024-05-29 10:33:26] [INFO ] Implicit Places using invariants in 395 ms returned []
[2024-05-29 10:33:26] [INFO ] Invariant cache hit.
[2024-05-29 10:33:26] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
[2024-05-29 10:33:26] [INFO ] Invariant cache hit.
[2024-05-29 10:33:26] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 160/233 places, 188/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1395 ms. Remains : 160/233 places, 188/263 transitions.
Support contains 19 out of 160 places after structural reductions.
[2024-05-29 10:33:27] [INFO ] Flatten gal took : 84 ms
[2024-05-29 10:33:27] [INFO ] Flatten gal took : 34 ms
[2024-05-29 10:33:27] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 18 out of 160 places (down from 19) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 71 resets, run finished after 678 ms. (steps per millisecond=14 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 10:33:28] [INFO ] Invariant cache hit.
[2024-05-29 10:33:28] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-29 10:33:28] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:28] [INFO ] After 127ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-29 10:33:28] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 9 ms to minimize.
[2024-05-29 10:33:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2024-05-29 10:33:28] [INFO ] After 260ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 10:33:28] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 10:33:29] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-29 10:33:29] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:29] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 10:33:29] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-29 10:33:29] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-29 10:33:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 205 ms
[2024-05-29 10:33:29] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 2 ms to minimize.
[2024-05-29 10:33:29] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2024-05-29 10:33:29] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-29 10:33:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2024-05-29 10:33:29] [INFO ] After 770ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 10:33:29] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 27 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 188/188 transitions.
Graph (trivial) has 142 edges and 160 vertex of which 80 / 160 are part of one of the 6 SCC in 4 ms
Free SCC test removed 74 places
Drop transitions removed 101 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 102 transitions.
Graph (complete) has 186 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 84 transition count 68
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 33 place count 70 transition count 68
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 33 place count 70 transition count 63
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 43 place count 65 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 63 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 63 transition count 61
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 85 place count 44 transition count 41
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 44 transition count 38
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 3 with 2 rules applied. Total rules applied 90 place count 43 transition count 37
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 43 transition count 36
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 97 place count 43 transition count 30
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 103 place count 37 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 104 place count 36 transition count 29
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 8 rules applied. Total rules applied 112 place count 33 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 117 place count 28 transition count 24
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 4 Pre rules applied. Total rules applied 117 place count 28 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 9 rules applied. Total rules applied 126 place count 23 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 127 place count 22 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 127 place count 22 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 129 place count 21 transition count 19
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 8 with 4 rules applied. Total rules applied 133 place count 19 transition count 17
Applied a total of 133 rules in 37 ms. Remains 19 /160 variables (removed 141) and now considering 17/188 (removed 171) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 19/160 places, 17/188 transitions.
Finished random walk after 72 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 14 stabilizing places and 14 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((G(p0)||G(p1))))'
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 152 transition count 180
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 152 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 152 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 149 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 147 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 147 transition count 174
Applied a total of 27 rules in 14 ms. Remains 147 /160 variables (removed 13) and now considering 174/188 (removed 14) transitions.
// Phase 1: matrix 174 rows 147 cols
[2024-05-29 10:33:30] [INFO ] Computed 12 invariants in 4 ms
[2024-05-29 10:33:30] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 10:33:30] [INFO ] Invariant cache hit.
[2024-05-29 10:33:30] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-29 10:33:30] [INFO ] Invariant cache hit.
[2024-05-29 10:33:30] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 147/160 places, 174/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 147/160 places, 174/188 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 337 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(NEQ s128 1), p0:(AND (EQ s117 0) (EQ s15 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 762 reset in 334 ms.
Product exploration explored 100000 steps with 741 reset in 262 ms.
Computed a total of 10 stabilizing places and 10 stable transitions
Computed a total of 10 stabilizing places and 10 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 191 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p1)]
Incomplete random walk after 10000 steps, including 76 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2099977 steps, run timeout after 3001 ms. (steps per millisecond=699 ) properties seen :{}
Probabilistic random walk after 2099977 steps, saw 358865 distinct states, run finished after 3006 ms. (steps per millisecond=698 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:33:35] [INFO ] Invariant cache hit.
[2024-05-29 10:33:35] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-29 10:33:35] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:35] [INFO ] After 95ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 10:33:35] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-29 10:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-29 10:33:35] [INFO ] After 170ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:33:35] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 10:33:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2024-05-29 10:33:35] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:35] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 10:33:35] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-29 10:33:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-29 10:33:35] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 10:33:35] [INFO ] After 266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 174/174 transitions.
Graph (trivial) has 135 edges and 147 vertex of which 80 / 147 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Drop transitions removed 102 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 105 transitions.
Graph (complete) has 162 edges and 73 vertex of which 71 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 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 15 rules applied. Total rules applied 17 place count 71 transition count 53
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 29 place count 59 transition count 53
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 29 place count 59 transition count 49
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 37 place count 55 transition count 49
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 54 transition count 48
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 54 transition count 48
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 71 place count 38 transition count 32
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 115 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 37 transition count 29
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 37 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 87 place count 31 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 30 transition count 22
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 15 rules applied. Total rules applied 103 place count 24 transition count 13
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 10 rules applied. Total rules applied 113 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 114 place count 14 transition count 12
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 114 place count 14 transition count 6
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 13 rules applied. Total rules applied 127 place count 7 transition count 6
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 128 place count 6 transition count 5
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 130 place count 5 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 133 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 134 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 134 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 136 place count 2 transition count 2
Applied a total of 136 rules in 48 ms. Remains 2 /147 variables (removed 145) and now considering 2/174 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 2/147 places, 2/174 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), true, (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 12 factoid took 218 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-10-LTLCardinality-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-10-LTLCardinality-00 finished in 5579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 152 transition count 180
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 152 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 152 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 148 transition count 175
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 148 transition count 175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 145 transition count 172
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 144 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 144 transition count 171
Applied a total of 33 rules in 25 ms. Remains 144 /160 variables (removed 16) and now considering 171/188 (removed 17) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-29 10:33:35] [INFO ] Computed 12 invariants in 3 ms
[2024-05-29 10:33:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 10:33:35] [INFO ] Invariant cache hit.
[2024-05-29 10:33:36] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-29 10:33:36] [INFO ] Invariant cache hit.
[2024-05-29 10:33:36] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/160 places, 171/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 144/160 places, 171/188 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s91 0) (EQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 281 ms.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-10-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-10-LTLCardinality-01 finished in 1140 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)||F(p1)) U X(p2)))'
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 153 transition count 181
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 153 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 153 transition count 180
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 151 transition count 178
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 151 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 150 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 150 transition count 177
Applied a total of 21 rules in 12 ms. Remains 150 /160 variables (removed 10) and now considering 177/188 (removed 11) transitions.
// Phase 1: matrix 177 rows 150 cols
[2024-05-29 10:33:36] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 10:33:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 10:33:37] [INFO ] Invariant cache hit.
[2024-05-29 10:33:37] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-29 10:33:37] [INFO ] Invariant cache hit.
[2024-05-29 10:33:37] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 150/160 places, 177/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 150/160 places, 177/188 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s126 1)), p1:(OR (EQ s111 0) (EQ s8 1)), p2:(OR (EQ s70 0) (EQ s101 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 184 ms.
Computed a total of 13 stabilizing places and 13 stable transitions
Computed a total of 13 stabilizing places and 13 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 19 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-10-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-10-LTLCardinality-04 finished in 995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Graph (trivial) has 145 edges and 160 vertex of which 80 / 160 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 85 transition count 77
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 71 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 29 place count 71 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 39 place count 66 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 42 place count 63 transition count 69
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 63 transition count 69
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 63 transition count 68
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 90 place count 41 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 96 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 98 place count 39 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 37 transition count 36
Applied a total of 100 rules in 26 ms. Remains 37 /160 variables (removed 123) and now considering 36/188 (removed 152) transitions.
[2024-05-29 10:33:37] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2024-05-29 10:33:37] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 10:33:38] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-29 10:33:38] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-29 10:33:38] [INFO ] Invariant cache hit.
[2024-05-29 10:33:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2024-05-29 10:33:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 10:33:38] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
[2024-05-29 10:33:38] [INFO ] Invariant cache hit.
[2024-05-29 10:33:38] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 37/160 places, 36/188 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 37/160 places, 36/188 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s30 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2536 steps with 202 reset in 9 ms.
FORMULA SmartHome-PT-10-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLCardinality-11 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 152 transition count 180
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 152 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 152 transition count 179
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 148 transition count 175
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 148 transition count 175
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 28 place count 145 transition count 172
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 145 transition count 172
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 144 transition count 171
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 144 transition count 171
Applied a total of 33 rules in 13 ms. Remains 144 /160 variables (removed 16) and now considering 171/188 (removed 17) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-29 10:33:38] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 10:33:38] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 10:33:38] [INFO ] Invariant cache hit.
[2024-05-29 10:33:38] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-29 10:33:38] [INFO ] Invariant cache hit.
[2024-05-29 10:33:38] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/160 places, 171/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 344 ms. Remains : 144/160 places, 171/188 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-12 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: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s55 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 759 reset in 146 ms.
Product exploration explored 100000 steps with 762 reset in 119 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2200379 steps, run timeout after 3001 ms. (steps per millisecond=733 ) properties seen :{}
Probabilistic random walk after 2200379 steps, saw 373720 distinct states, run finished after 3001 ms. (steps per millisecond=733 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:33:42] [INFO ] Invariant cache hit.
[2024-05-29 10:33:42] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-29 10:33:42] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:42] [INFO ] After 101ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 10:33:42] [INFO ] After 120ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-29 10:33:42] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 171/171 transitions.
Graph (trivial) has 131 edges and 144 vertex of which 80 / 144 are part of one of the 6 SCC in 0 ms
Free SCC test removed 74 places
Drop transitions removed 102 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 105 transitions.
Graph (complete) has 158 edges and 70 vertex of which 68 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 68 transition count 52
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 25 place count 58 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 25 place count 58 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 53 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 52 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 52 transition count 46
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 38 transition count 32
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 130 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 37 transition count 29
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 37 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 81 place count 31 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 30 transition count 22
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 12 rules applied. Total rules applied 94 place count 25 transition count 15
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 101 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 101 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 112 place count 12 transition count 10
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 6 with 2 rules applied. Total rules applied 114 place count 11 transition count 9
Applied a total of 114 rules in 22 ms. Remains 11 /144 variables (removed 133) and now considering 9/171 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 11/144 places, 9/171 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 171/171 transitions.
Applied a total of 0 rules in 2 ms. Remains 144 /144 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2024-05-29 10:33:43] [INFO ] Invariant cache hit.
[2024-05-29 10:33:43] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-29 10:33:43] [INFO ] Invariant cache hit.
[2024-05-29 10:33:43] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-29 10:33:43] [INFO ] Invariant cache hit.
[2024-05-29 10:33:43] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 450 ms. Remains : 144/144 places, 171/171 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 82 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1885933 steps, run timeout after 3001 ms. (steps per millisecond=628 ) properties seen :{}
Probabilistic random walk after 1885933 steps, saw 328035 distinct states, run finished after 3001 ms. (steps per millisecond=628 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-29 10:33:46] [INFO ] Invariant cache hit.
[2024-05-29 10:33:46] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-29 10:33:46] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-29 10:33:47] [INFO ] After 71ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-29 10:33:47] [INFO ] After 86ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-29 10:33:47] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 171/171 transitions.
Graph (trivial) has 131 edges and 144 vertex of which 80 / 144 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Drop transitions removed 102 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 105 transitions.
Graph (complete) has 158 edges and 70 vertex of which 68 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 68 transition count 52
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 25 place count 58 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 25 place count 58 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 35 place count 53 transition count 47
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 52 transition count 46
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 52 transition count 46
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 65 place count 38 transition count 32
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 130 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 37 transition count 29
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 37 transition count 23
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 81 place count 31 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 30 transition count 22
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 4 with 12 rules applied. Total rules applied 94 place count 25 transition count 15
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 101 place count 18 transition count 15
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 101 place count 18 transition count 10
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 11 rules applied. Total rules applied 112 place count 12 transition count 10
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 6 with 2 rules applied. Total rules applied 114 place count 11 transition count 9
Applied a total of 114 rules in 25 ms. Remains 11 /144 variables (removed 133) and now considering 9/171 (removed 162) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 11/144 places, 9/171 transitions.
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 210 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 766 reset in 142 ms.
Product exploration explored 100000 steps with 764 reset in 122 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 171/171 transitions.
Graph (trivial) has 131 edges and 144 vertex of which 80 / 144 are part of one of the 6 SCC in 1 ms
Free SCC test removed 74 places
Ensure Unique test removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 70 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 11 place count 70 transition count 72
Deduced a syphon composed of 14 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 70 transition count 72
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 64 transition count 66
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 64 transition count 66
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 43 place count 64 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 60 transition count 62
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 60 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 60 transition count 64
Deduced a syphon composed of 21 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 60 transition count 58
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 209 edges and 58 vertex of which 56 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
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 56 transition count 56
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 54 transition count 54
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 54 transition count 54
Deduced a syphon composed of 17 places in 0 ms
Applied a total of 65 rules in 29 ms. Remains 54 /144 variables (removed 90) and now considering 54/171 (removed 117) transitions.
[2024-05-29 10:33:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 10:33:48] [INFO ] Flow matrix only has 49 transitions (discarded 5 similar events)
// Phase 1: matrix 49 rows 54 cols
[2024-05-29 10:33:48] [INFO ] Computed 10 invariants in 1 ms
[2024-05-29 10:33:48] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/144 places, 54/171 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 54/144 places, 54/171 transitions.
Built C files in :
/tmp/ltsmin17013847232149709372
[2024-05-29 10:33:48] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17013847232149709372
Running compilation step : cd /tmp/ltsmin17013847232149709372;'/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 769 ms.
Running link step : cd /tmp/ltsmin17013847232149709372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 101 ms.
Running LTSmin : cd /tmp/ltsmin17013847232149709372;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6793929977602360129.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 171/171 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 171/171 (removed 0) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-29 10:34:03] [INFO ] Computed 12 invariants in 2 ms
[2024-05-29 10:34:03] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 10:34:03] [INFO ] Invariant cache hit.
[2024-05-29 10:34:04] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-29 10:34:04] [INFO ] Invariant cache hit.
[2024-05-29 10:34:04] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 144/144 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin6676942389860225621
[2024-05-29 10:34:04] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6676942389860225621
Running compilation step : cd /tmp/ltsmin6676942389860225621;'/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 413 ms.
Running link step : cd /tmp/ltsmin6676942389860225621;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6676942389860225621;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17392823339728678544.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 10:34:19] [INFO ] Flatten gal took : 13 ms
[2024-05-29 10:34:19] [INFO ] Flatten gal took : 12 ms
[2024-05-29 10:34:19] [INFO ] Time to serialize gal into /tmp/LTL5431886536799735662.gal : 4 ms
[2024-05-29 10:34:19] [INFO ] Time to serialize properties into /tmp/LTL7528892080367631114.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5431886536799735662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5409689912568502593.hoa' '-atoms' '/tmp/LTL7528892080367631114.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL7528892080367631114.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5409689912568502593.hoa
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t92, t106, t160, t161, Intersection with reachable at each step enabled. (des...199
Computing Next relation with stutter on 57 deadlock states
Detected timeout of ITS tools.
[2024-05-29 10:34:34] [INFO ] Flatten gal took : 10 ms
[2024-05-29 10:34:34] [INFO ] Flatten gal took : 10 ms
[2024-05-29 10:34:34] [INFO ] Time to serialize gal into /tmp/LTL12398972442530983987.gal : 3 ms
[2024-05-29 10:34:34] [INFO ] Time to serialize properties into /tmp/LTL8351109233654509279.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12398972442530983987.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8351109233654509279.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(p119!=1)"))))))
Formula 0 simplified : XXXF!"(p119!=1)"
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t92, t106, t160, t161, Intersection with reachable at each step enabled. (des...199
Computing Next relation with stutter on 57 deadlock states
Detected timeout of ITS tools.
[2024-05-29 10:34:49] [INFO ] Flatten gal took : 11 ms
[2024-05-29 10:34:49] [INFO ] Applying decomposition
[2024-05-29 10:34:49] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11747099878796867344.txt' '-o' '/tmp/graph11747099878796867344.bin' '-w' '/tmp/graph11747099878796867344.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11747099878796867344.bin' '-l' '-1' '-v' '-w' '/tmp/graph11747099878796867344.weights' '-q' '0' '-e' '0.001'
[2024-05-29 10:34:49] [INFO ] Decomposing Gal with order
[2024-05-29 10:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 10:34:49] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-29 10:34:49] [INFO ] Flatten gal took : 60 ms
[2024-05-29 10:34:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 10:34:49] [INFO ] Time to serialize gal into /tmp/LTL5169778922402744413.gal : 6 ms
[2024-05-29 10:34:49] [INFO ] Time to serialize properties into /tmp/LTL2336713683206079737.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5169778922402744413.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2336713683206079737.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(G("(i4.u21.p119!=1)"))))))
Formula 0 simplified : XXXF!"(i4.u21.p119!=1)"
Reverse transition relation is NOT exact ! Due to transitions t15, t106, i0.i0.u1.t160, i0.i0.u41.t13, i0.i0.u42.t12, i1.t161, i4.u21.t92, Intersection wi...238
Computing Next relation with stutter on 57 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
22 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.250916,22460,1,0,14371,1532,2305,21798,441,4432,36923
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SmartHome-PT-10-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property SmartHome-PT-10-LTLCardinality-12 finished in 71832 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(((G(p1)||G(p2))&&p0))))'
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 188/188 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 154 transition count 182
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 154 transition count 182
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 151 transition count 179
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 151 transition count 179
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 149 transition count 177
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 149 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 148 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 148 transition count 176
Applied a total of 24 rules in 13 ms. Remains 148 /160 variables (removed 12) and now considering 176/188 (removed 12) transitions.
// Phase 1: matrix 176 rows 148 cols
[2024-05-29 10:34:50] [INFO ] Computed 12 invariants in 6 ms
[2024-05-29 10:34:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 10:34:50] [INFO ] Invariant cache hit.
[2024-05-29 10:34:50] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-29 10:34:50] [INFO ] Invariant cache hit.
[2024-05-29 10:34:50] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 148/160 places, 176/188 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 148/160 places, 176/188 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-10-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (EQ s4 0) (EQ s59 1)), p1:(AND (EQ s4 0) (EQ s59 1)), p2:(AND (EQ s104 0) (EQ s25 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-LTLCardinality-15 finished in 579 ms.
All properties solved by simple procedures.
Total runtime 85726 ms.

BK_STOP 1716978891626

--------------------
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="SmartHome-PT-10"
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 SmartHome-PT-10, 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 r395-smll-171683824300257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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