Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241600323.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-17, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600323
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 7.0K Apr 29 15:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 15:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 29 15:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 9 09:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 9 09:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 09:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 139K May 10 09:34 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-17-LTLCardinality-00
FORMULA_NAME SmartHome-PT-17-LTLCardinality-01
FORMULA_NAME SmartHome-PT-17-LTLCardinality-02
FORMULA_NAME SmartHome-PT-17-LTLCardinality-03
FORMULA_NAME SmartHome-PT-17-LTLCardinality-04
FORMULA_NAME SmartHome-PT-17-LTLCardinality-05
FORMULA_NAME SmartHome-PT-17-LTLCardinality-06
FORMULA_NAME SmartHome-PT-17-LTLCardinality-07
FORMULA_NAME SmartHome-PT-17-LTLCardinality-08
FORMULA_NAME SmartHome-PT-17-LTLCardinality-09
FORMULA_NAME SmartHome-PT-17-LTLCardinality-10
FORMULA_NAME SmartHome-PT-17-LTLCardinality-11
FORMULA_NAME SmartHome-PT-17-LTLCardinality-12
FORMULA_NAME SmartHome-PT-17-LTLCardinality-13
FORMULA_NAME SmartHome-PT-17-LTLCardinality-14
FORMULA_NAME SmartHome-PT-17-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653109789343

Running Version 202205111006
[2022-05-21 05:09:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 05:09:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:09:51] [INFO ] Load time of PNML (sax parser for PT used): 227 ms
[2022-05-21 05:09:51] [INFO ] Transformed 571 places.
[2022-05-21 05:09:51] [INFO ] Transformed 617 transitions.
[2022-05-21 05:09:51] [INFO ] Found NUPN structural information;
[2022-05-21 05:09:51] [INFO ] Parsed PT model containing 571 places and 617 transitions in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 176 places in 12 ms
Reduce places removed 176 places and 150 transitions.
FORMULA SmartHome-PT-17-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 395 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 395/395 places, 467/467 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 380 transition count 467
Discarding 101 places :
Symmetric choice reduction at 1 with 101 rule applications. Total rules 116 place count 279 transition count 366
Iterating global reduction 1 with 101 rules applied. Total rules applied 217 place count 279 transition count 366
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 227 place count 279 transition count 356
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 247 place count 259 transition count 336
Iterating global reduction 2 with 20 rules applied. Total rules applied 267 place count 259 transition count 336
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 287 place count 239 transition count 316
Iterating global reduction 2 with 20 rules applied. Total rules applied 307 place count 239 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 309 place count 239 transition count 314
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 314 place count 234 transition count 309
Iterating global reduction 3 with 5 rules applied. Total rules applied 319 place count 234 transition count 309
Applied a total of 319 rules in 155 ms. Remains 234 /395 variables (removed 161) and now considering 309/467 (removed 158) transitions.
// Phase 1: matrix 309 rows 234 cols
[2022-05-21 05:09:52] [INFO ] Computed 3 place invariants in 27 ms
[2022-05-21 05:09:52] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 309 rows 234 cols
[2022-05-21 05:09:52] [INFO ] Computed 3 place invariants in 13 ms
[2022-05-21 05:09:52] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
// Phase 1: matrix 309 rows 234 cols
[2022-05-21 05:09:52] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 05:09:53] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/395 places, 309/467 transitions.
Finished structural reductions, in 1 iterations. Remains : 234/395 places, 309/467 transitions.
Support contains 24 out of 234 places after structural reductions.
[2022-05-21 05:09:53] [INFO ] Flatten gal took : 84 ms
[2022-05-21 05:09:53] [INFO ] Flatten gal took : 34 ms
[2022-05-21 05:09:53] [INFO ] Input system was already deterministic with 309 transitions.
Support contains 23 out of 234 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 686 ms. (steps per millisecond=14 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 309 rows 234 cols
[2022-05-21 05:09:54] [INFO ] Computed 3 place invariants in 8 ms
[2022-05-21 05:09:55] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-21 05:09:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-21 05:09:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 05:09:55] [INFO ] After 314ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 9 simplifications.
FORMULA SmartHome-PT-17-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-17-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 47 stabilizing places and 46 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X((X(G(p0))||X(p1)))))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Graph (trivial) has 246 edges and 234 vertex of which 137 / 234 are part of one of the 12 SCC in 21 ms
Free SCC test removed 125 places
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 168 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 108 transition count 107
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 68 place count 75 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 74 transition count 106
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 69 place count 74 transition count 101
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 69 transition count 101
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 83 place count 65 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 87 place count 65 transition count 95
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 64 transition count 94
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 64 transition count 94
Performed 33 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 155 place count 31 transition count 57
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 29 transition count 52
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 29 transition count 52
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 173 place count 29 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 174 place count 28 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 174 place count 28 transition count 37
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 176 place count 27 transition count 37
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 178 place count 25 transition count 33
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 25 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 24 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 182 place count 23 transition count 32
Applied a total of 182 rules in 66 ms. Remains 23 /234 variables (removed 211) and now considering 32/309 (removed 277) transitions.
[2022-05-21 05:09:55] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:09:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:09:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-21 05:09:55] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:09:55] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:09:55] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-05-21 05:09:55] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 05:09:55] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:09:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:09:55] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/234 places, 32/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/234 places, 32/309 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 0), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 135 steps with 5 reset in 4 ms.
FORMULA SmartHome-PT-17-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-00 finished in 569 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(X(p0))))||X(F(X(X(p1))))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 224 transition count 299
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 224 transition count 299
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 217 transition count 292
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 217 transition count 292
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 214 transition count 289
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 214 transition count 289
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 43 place count 211 transition count 286
Iterating global reduction 0 with 3 rules applied. Total rules applied 46 place count 211 transition count 286
Applied a total of 46 rules in 39 ms. Remains 211 /234 variables (removed 23) and now considering 286/309 (removed 23) transitions.
// Phase 1: matrix 286 rows 211 cols
[2022-05-21 05:09:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:09:56] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 286 rows 211 cols
[2022-05-21 05:09:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:09:56] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 211 cols
[2022-05-21 05:09:56] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 05:09:56] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 211/234 places, 286/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 211/234 places, 286/309 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), 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=[p1:(AND (EQ s58 0) (EQ s86 1)), p0:(EQ s57 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1349 steps with 6 reset in 13 ms.
FORMULA SmartHome-PT-17-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-03 finished in 751 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(p0)))))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 224 transition count 299
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 224 transition count 299
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 218 transition count 293
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 218 transition count 293
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 215 transition count 290
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 215 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 212 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 212 transition count 287
Applied a total of 44 rules in 17 ms. Remains 212 /234 variables (removed 22) and now considering 287/309 (removed 22) transitions.
// Phase 1: matrix 287 rows 212 cols
[2022-05-21 05:09:56] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:09:57] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 287 rows 212 cols
[2022-05-21 05:09:57] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:09:57] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 212 cols
[2022-05-21 05:09:57] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 05:09:57] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 212/234 places, 287/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 212/234 places, 287/309 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s126 0) (EQ s67 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 2 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-17-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-04 finished in 721 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Graph (trivial) has 246 edges and 234 vertex of which 145 / 234 are part of one of the 12 SCC in 1 ms
Free SCC test removed 133 places
Ensure Unique test removed 178 transitions
Reduce isomorphic transitions removed 178 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 100 transition count 101
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 71 transition count 99
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 70 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 69 transition count 98
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 64 place count 69 transition count 94
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 72 place count 65 transition count 94
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 76 place count 61 transition count 88
Iterating global reduction 4 with 4 rules applied. Total rules applied 80 place count 61 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 60 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 60 transition count 87
Performed 29 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 140 place count 31 transition count 56
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 30 transition count 52
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 30 transition count 52
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 156 place count 30 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 29 transition count 38
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 157 place count 29 transition count 37
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 159 place count 28 transition count 37
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 161 place count 26 transition count 33
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 26 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 25 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 24 transition count 32
Applied a total of 165 rules in 24 ms. Remains 24 /234 variables (removed 210) and now considering 32/309 (removed 277) transitions.
[2022-05-21 05:09:57] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 05:09:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:09:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-05-21 05:09:57] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 05:09:57] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:09:57] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-21 05:09:57] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-21 05:09:57] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 24 cols
[2022-05-21 05:09:57] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-21 05:09:57] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/234 places, 32/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/234 places, 32/309 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-05 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:(AND (EQ s4 0) (EQ s1 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 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-17-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-17-LTLCardinality-05 finished in 394 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)||X(X(p1))))&&F(p2)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 223 transition count 298
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 223 transition count 298
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 217 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 217 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 215 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 215 transition count 290
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 213 transition count 288
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 213 transition count 288
Applied a total of 42 rules in 14 ms. Remains 213 /234 variables (removed 21) and now considering 288/309 (removed 21) transitions.
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:09:58] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:09:58] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:09:58] [INFO ] Computed 3 place invariants in 4 ms
[2022-05-21 05:09:58] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:09:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:09:58] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 213/234 places, 288/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/234 places, 288/309 transitions.
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 6}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (EQ s0 0) (EQ s142 1)), p0:(EQ s120 1), p1:(EQ s120 0)], 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33294 reset in 713 ms.
Product exploration explored 100000 steps with 33302 reset in 467 ms.
Computed a total of 34 stabilizing places and 33 stable transitions
Computed a total of 34 stabilizing places and 33 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X p2), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 381 ms. Reduced automaton from 9 states, 14 edges and 3 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 772 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=110 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p0)), (X p2), true, (X (X (NOT p0))), (X (X p2))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 300 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 213 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 288/288 transitions.
Applied a total of 0 rules in 4 ms. Remains 213 /213 variables (removed 0) and now considering 288/288 (removed 0) transitions.
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:10:01] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:10:01] [INFO ] Implicit Places using invariants in 105 ms returned []
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:10:01] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 05:10:02] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
// Phase 1: matrix 288 rows 213 cols
[2022-05-21 05:10:02] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 05:10:02] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 213/213 places, 288/288 transitions.
Computed a total of 34 stabilizing places and 33 stable transitions
Computed a total of 34 stabilizing places and 33 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Finished random walk after 112 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=56 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 291 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 262 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 213 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 213/213 places, 288/288 transitions.
Graph (trivial) has 226 edges and 213 vertex of which 133 / 213 are part of one of the 12 SCC in 1 ms
Free SCC test removed 121 places
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 92 transition count 122
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 92 transition count 121
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 31 place count 92 transition count 121
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 92 transition count 121
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 56 place count 71 transition count 98
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 77 place count 71 transition count 98
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 105 place count 71 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 106 place count 71 transition count 97
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 119 place count 58 transition count 78
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 3 with 13 rules applied. Total rules applied 132 place count 58 transition count 78
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 134 place count 56 transition count 76
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 56 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 56 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 54 transition count 74
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 54 transition count 74
Deduced a syphon composed of 28 places in 0 ms
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 3 with 13 rules applied. Total rules applied 154 place count 54 transition count 61
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 146 edges and 52 vertex of which 50 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 3 with 3 rules applied. Total rules applied 157 place count 50 transition count 59
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 160 place count 47 transition count 54
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 4 with 3 rules applied. Total rules applied 163 place count 47 transition count 54
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 163 rules in 35 ms. Remains 47 /213 variables (removed 166) and now considering 54/288 (removed 234) transitions.
[2022-05-21 05:10:04] [INFO ] Redundant transitions in 30 ms returned []
[2022-05-21 05:10:04] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
// Phase 1: matrix 48 rows 47 cols
[2022-05-21 05:10:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:10:04] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/213 places, 54/288 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/213 places, 54/288 transitions.
Product exploration explored 100000 steps with 25000 reset in 425 ms.
Product exploration explored 100000 steps with 25000 reset in 417 ms.
Built C files in :
/tmp/ltsmin6691543407080425687
[2022-05-21 05:10:05] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6691543407080425687
Running compilation step : cd /tmp/ltsmin6691543407080425687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 898 ms.
Running link step : cd /tmp/ltsmin6691543407080425687;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin6691543407080425687;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17299373067671029596.hoa' '--buchi-type=spotba'
LTSmin run took 342 ms.
FORMULA SmartHome-PT-17-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-17-LTLCardinality-14 finished in 8774 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (F(X(p1))&&p1)))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 309/309 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 225 transition count 300
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 225 transition count 300
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 219 transition count 294
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 219 transition count 294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 217 transition count 292
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 217 transition count 292
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 215 transition count 290
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 215 transition count 290
Applied a total of 38 rules in 34 ms. Remains 215 /234 variables (removed 19) and now considering 290/309 (removed 19) transitions.
// Phase 1: matrix 290 rows 215 cols
[2022-05-21 05:10:06] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 05:10:06] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 290 rows 215 cols
[2022-05-21 05:10:06] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 05:10:07] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
// Phase 1: matrix 290 rows 215 cols
[2022-05-21 05:10:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:10:07] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 215/234 places, 290/309 transitions.
Finished structural reductions, in 1 iterations. Remains : 215/234 places, 290/309 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), true, (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-17-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}, { cond=p1, acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s62 0) (EQ s148 1)), p0:(OR (EQ s146 0) (EQ s26 1) (EQ s55 0) (EQ s74 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 509 ms.
Product exploration explored 100000 steps with 50000 reset in 692 ms.
Computed a total of 38 stabilizing places and 37 stable transitions
Computed a total of 38 stabilizing places and 37 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 10 factoid took 273 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-17-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-17-LTLCardinality-15 finished in 2361 ms.
All properties solved by simple procedures.
Total runtime 17981 ms.

BK_STOP 1653109809366

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-17"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-17, 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 r240-smll-165303241600323"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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