fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r457-smll-167912649100260
Last Updated
May 14, 2023

About the Execution of LTSMin+red for SmartHome-PT-14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
490.411 23303.00 47310.00 551.90 FFFTTF?FFFFTFFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 05:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 05:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 05:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 05:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 05:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 05:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 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-14-LTLFireability-00
FORMULA_NAME SmartHome-PT-14-LTLFireability-01
FORMULA_NAME SmartHome-PT-14-LTLFireability-02
FORMULA_NAME SmartHome-PT-14-LTLFireability-03
FORMULA_NAME SmartHome-PT-14-LTLFireability-04
FORMULA_NAME SmartHome-PT-14-LTLFireability-05
FORMULA_NAME SmartHome-PT-14-LTLFireability-06
FORMULA_NAME SmartHome-PT-14-LTLFireability-07
FORMULA_NAME SmartHome-PT-14-LTLFireability-08
FORMULA_NAME SmartHome-PT-14-LTLFireability-09
FORMULA_NAME SmartHome-PT-14-LTLFireability-10
FORMULA_NAME SmartHome-PT-14-LTLFireability-11
FORMULA_NAME SmartHome-PT-14-LTLFireability-12
FORMULA_NAME SmartHome-PT-14-LTLFireability-13
FORMULA_NAME SmartHome-PT-14-LTLFireability-14
FORMULA_NAME SmartHome-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679324617900

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-14
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 15:03:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 15:03:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:03:41] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2023-03-20 15:03:41] [INFO ] Transformed 422 places.
[2023-03-20 15:03:41] [INFO ] Transformed 448 transitions.
[2023-03-20 15:03:41] [INFO ] Found NUPN structural information;
[2023-03-20 15:03:41] [INFO ] Parsed PT model containing 422 places and 448 transitions and 1026 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 129 places in 7 ms
Reduce places removed 129 places and 104 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-14-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-14-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-14-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 293 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 293/293 places, 344/344 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 282 transition count 344
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 85 place count 208 transition count 270
Iterating global reduction 1 with 74 rules applied. Total rules applied 159 place count 208 transition count 270
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 166 place count 208 transition count 263
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 182 place count 192 transition count 247
Iterating global reduction 2 with 16 rules applied. Total rules applied 198 place count 192 transition count 247
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 212 place count 178 transition count 233
Iterating global reduction 2 with 14 rules applied. Total rules applied 226 place count 178 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 227 place count 178 transition count 232
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 233 place count 172 transition count 226
Iterating global reduction 3 with 6 rules applied. Total rules applied 239 place count 172 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 241 place count 170 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 243 place count 170 transition count 224
Applied a total of 243 rules in 155 ms. Remains 170 /293 variables (removed 123) and now considering 224/344 (removed 120) transitions.
// Phase 1: matrix 224 rows 170 cols
[2023-03-20 15:03:41] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-20 15:03:41] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-20 15:03:41] [INFO ] Invariant cache hit.
[2023-03-20 15:03:42] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2023-03-20 15:03:42] [INFO ] Invariant cache hit.
[2023-03-20 15:03:42] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 170/293 places, 224/344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1038 ms. Remains : 170/293 places, 224/344 transitions.
Support contains 16 out of 170 places after structural reductions.
[2023-03-20 15:03:42] [INFO ] Flatten gal took : 100 ms
[2023-03-20 15:03:42] [INFO ] Flatten gal took : 34 ms
[2023-03-20 15:03:43] [INFO ] Input system was already deterministic with 224 transitions.
Support contains 15 out of 170 places (down from 16) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 49 resets, run finished after 399 ms. (steps per millisecond=25 ) properties (out of 14) seen :13
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 15:03:43] [INFO ] Invariant cache hit.
[2023-03-20 15:03:43] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 15:03:43] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 9 ms returned sat
[2023-03-20 15:03:44] [INFO ] After 407ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 15:03:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-20 15:03:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2023-03-20 15:03:44] [INFO ] After 415ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 15:03:44] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-20 15:03:44] [INFO ] After 627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 224/224 transitions.
Graph (trivial) has 172 edges and 170 vertex of which 92 / 170 are part of one of the 7 SCC in 22 ms
Free SCC test removed 85 places
Drop transitions removed 124 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 129 transitions.
Graph (complete) has 133 edges and 85 vertex of which 74 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 74 transition count 50
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 36 rules applied. Total rules applied 78 place count 44 transition count 44
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 81 place count 41 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 41 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 39 transition count 42
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 35 transition count 38
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 35 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 35 transition count 37
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 128 place count 18 transition count 19
Drop transitions removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 28 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 8 rules applied. Total rules applied 136 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 14 transition count 11
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 143 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 145 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 145 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 147 place count 7 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 148 place count 6 transition count 7
Applied a total of 148 rules in 48 ms. Remains 6 /170 variables (removed 164) and now considering 7/224 (removed 217) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 6/170 places, 7/224 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Computed a total of 35 stabilizing places and 34 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(F(p1)) U p1)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 163 transition count 217
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 163 transition count 217
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 163 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 160 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 160 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 158 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 158 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 158 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 157 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 157 transition count 209
Applied a total of 28 rules in 21 ms. Remains 157 /170 variables (removed 13) and now considering 209/224 (removed 15) transitions.
// Phase 1: matrix 209 rows 157 cols
[2023-03-20 15:03:45] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-20 15:03:45] [INFO ] Implicit Places using invariants in 188 ms returned []
[2023-03-20 15:03:45] [INFO ] Invariant cache hit.
[2023-03-20 15:03:45] [INFO ] Implicit Places using invariants and state equation in 675 ms returned []
Implicit Place search using SMT with State Equation took 866 ms to find 0 implicit places.
[2023-03-20 15:03:45] [INFO ] Invariant cache hit.
[2023-03-20 15:03:46] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/170 places, 209/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 157/170 places, 209/224 transitions.
Stuttering acceptance computed with spot in 387 ms :[(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-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s20 1) (EQ s136 1)), p0:(EQ s44 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 1812 reset in 605 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA SmartHome-PT-14-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-14-LTLFireability-00 finished in 2152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||(G(p1)&&X(p2)))))'
Support contains 4 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 165 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 165 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 165 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 163 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 163 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 162 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 162 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 162 transition count 214
Applied a total of 18 rules in 20 ms. Remains 162 /170 variables (removed 8) and now considering 214/224 (removed 10) transitions.
// Phase 1: matrix 214 rows 162 cols
[2023-03-20 15:03:47] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-20 15:03:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-20 15:03:47] [INFO ] Invariant cache hit.
[2023-03-20 15:03:47] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-20 15:03:47] [INFO ] Invariant cache hit.
[2023-03-20 15:03:47] [INFO ] Dead Transitions using invariants and state equation in 493 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 162/170 places, 214/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 733 ms. Remains : 162/170 places, 214/224 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s46 1) (EQ s150 1)), p1:(EQ s47 0), p2:(EQ s24 0)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1538 reset in 353 ms.
Stack based approach found an accepted trace after 77 steps with 7 reset with depth 64 and stack size 64 in 0 ms.
FORMULA SmartHome-PT-14-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property SmartHome-PT-14-LTLFireability-02 finished in 1307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G(p1))||G(p0))))'
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 163 transition count 217
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 163 transition count 217
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 163 transition count 216
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 160 transition count 213
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 160 transition count 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 23 place count 158 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 158 transition count 211
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 158 transition count 210
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 157 transition count 209
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 157 transition count 209
Applied a total of 28 rules in 19 ms. Remains 157 /170 variables (removed 13) and now considering 209/224 (removed 15) transitions.
// Phase 1: matrix 209 rows 157 cols
[2023-03-20 15:03:48] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-20 15:03:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-20 15:03:48] [INFO ] Invariant cache hit.
[2023-03-20 15:03:48] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
[2023-03-20 15:03:49] [INFO ] Invariant cache hit.
[2023-03-20 15:03:49] [INFO ] Dead Transitions using invariants and state equation in 382 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/170 places, 209/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 157/170 places, 209/224 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s58 1), p0:(NEQ s114 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2128 reset in 187 ms.
Product exploration explored 100000 steps with 2239 reset in 549 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 548 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 5940 steps, including 34 resets, run visited all 4 properties in 87 ms. (steps per millisecond=68 )
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 830 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 209/209 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2023-03-20 15:03:52] [INFO ] Invariant cache hit.
[2023-03-20 15:03:52] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-20 15:03:52] [INFO ] Invariant cache hit.
[2023-03-20 15:03:52] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-20 15:03:52] [INFO ] Invariant cache hit.
[2023-03-20 15:03:52] [INFO ] Dead Transitions using invariants and state equation in 187 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 586 ms. Remains : 157/157 places, 209/209 transitions.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 455 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Finished random walk after 112 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=28 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 561 ms. Reduced automaton from 3 states, 13 edges and 2 AP (stutter sensitive) to 3 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2112 reset in 184 ms.
Product exploration explored 100000 steps with 2220 reset in 245 ms.
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 209/209 transitions.
Applied a total of 0 rules in 2 ms. Remains 157 /157 variables (removed 0) and now considering 209/209 (removed 0) transitions.
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:55] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:55] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:55] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 157/157 places, 209/209 transitions.
Treatment of property SmartHome-PT-14-LTLFireability-06 finished in 7115 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 170 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Graph (trivial) has 172 edges and 170 vertex of which 92 / 170 are part of one of the 7 SCC in 1 ms
Free SCC test removed 85 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 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 84 transition count 79
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 65 place count 55 transition count 73
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 52 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 68 place count 52 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 74 place count 49 transition count 70
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 46 transition count 67
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 46 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 46 transition count 66
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 121 place count 26 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 25 transition count 43
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 25 transition count 43
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 137 place count 25 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 139 place count 23 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 139 place count 23 transition count 29
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 141 place count 22 transition count 29
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 21 transition count 27
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 21 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 20 transition count 26
Applied a total of 144 rules in 32 ms. Remains 20 /170 variables (removed 150) and now considering 26/224 (removed 198) transitions.
[2023-03-20 15:03:55] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 20 cols
[2023-03-20 15:03:55] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-20 15:03:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-20 15:03:55] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:55] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-20 15:03:55] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-20 15:03:55] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:55] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/170 places, 26/224 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 20/170 places, 26/224 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-14-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-08 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 164 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 164 transition count 217
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 161 transition count 214
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 161 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 159 transition count 212
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 159 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 159 transition count 211
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 158 transition count 210
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 158 transition count 210
Applied a total of 26 rules in 26 ms. Remains 158 /170 variables (removed 12) and now considering 210/224 (removed 14) transitions.
// Phase 1: matrix 210 rows 158 cols
[2023-03-20 15:03:55] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-20 15:03:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 15:03:55] [INFO ] Invariant cache hit.
[2023-03-20 15:03:56] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-20 15:03:56] [INFO ] Invariant cache hit.
[2023-03-20 15:03:56] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/170 places, 210/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 158/170 places, 210/224 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s59 1) (EQ s147 1)), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-14-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-13 finished in 751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(X(p0)&&(G((G(!p1)||X(p2)))||(!p2&&(G(!p1)||X(p2))))))))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 164 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 164 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 164 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 162 transition count 215
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 162 transition count 215
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 160 transition count 213
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 160 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 160 transition count 212
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 159 transition count 211
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 159 transition count 211
Applied a total of 24 rules in 13 ms. Remains 159 /170 variables (removed 11) and now considering 211/224 (removed 13) transitions.
// Phase 1: matrix 211 rows 159 cols
[2023-03-20 15:03:56] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-20 15:03:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-20 15:03:56] [INFO ] Invariant cache hit.
[2023-03-20 15:03:56] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-20 15:03:56] [INFO ] Invariant cache hit.
[2023-03-20 15:03:56] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 159/170 places, 211/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 447 ms. Remains : 159/170 places, 211/224 transitions.
Stuttering acceptance computed with spot in 662 ms :[true, (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p2) p1), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND p1 p2), acceptance={} source=1 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 9}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 11}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 11}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=6 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={} source=7 dest: 0}, { cond=(AND p1 p2 p0), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=7 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=7 dest: 9}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=8 dest: 9}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 10}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=p1, acceptance={} source=11 dest: 0}, { cond=(NOT p1), acceptance={} source=11 dest: 11}]], initial=1, aps=[p1:(EQ s44 1), p2:(NEQ s136 1), p0:(NEQ s89 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41254 steps with 3478 reset in 111 ms.
FORMULA SmartHome-PT-14-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-14-LTLFireability-14 finished in 1254 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((p0&&(p0 U X(p0))&&F(p1))) U p2)))'
Support contains 3 out of 170 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 165 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 165 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 165 transition count 218
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 163 transition count 216
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 163 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 162 transition count 215
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 162 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 161 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 161 transition count 214
Applied a total of 19 rules in 11 ms. Remains 161 /170 variables (removed 9) and now considering 214/224 (removed 10) transitions.
// Phase 1: matrix 214 rows 161 cols
[2023-03-20 15:03:57] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-20 15:03:57] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-20 15:03:57] [INFO ] Invariant cache hit.
[2023-03-20 15:03:58] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-20 15:03:58] [INFO ] Invariant cache hit.
[2023-03-20 15:03:58] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/170 places, 214/224 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 161/170 places, 214/224 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p2), (NOT p2), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-14-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(NEQ s56 1), p0:(EQ s46 1), p1:(EQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 302 ms.
Computed a total of 29 stabilizing places and 28 stable transitions
Computed a total of 29 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), true, (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 (NOT p0) (NOT p1))
Knowledge based reduction with 11 factoid took 463 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-14-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-14-LTLFireability-15 finished in 1674 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((X(p0)&&G(p1))||G(p0))))'
Found a Shortening insensitive property : SmartHome-PT-14-LTLFireability-06
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 170/170 places, 224/224 transitions.
Graph (trivial) has 170 edges and 170 vertex of which 89 / 170 are part of one of the 7 SCC in 1 ms
Free SCC test removed 82 places
Ensure Unique test removed 110 transitions
Reduce isomorphic transitions removed 110 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 87 transition count 85
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 59 transition count 81
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 57 transition count 81
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 63 place count 57 transition count 78
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 69 place count 54 transition count 78
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 73 place count 50 transition count 74
Iterating global reduction 3 with 4 rules applied. Total rules applied 77 place count 50 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 50 transition count 73
Performed 23 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 124 place count 27 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 27 transition count 46
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 138 place count 27 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 140 place count 25 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 140 place count 25 transition count 32
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 142 place count 24 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 143 place count 23 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 144 place count 23 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 22 transition count 29
Applied a total of 145 rules in 24 ms. Remains 22 /170 variables (removed 148) and now considering 29/224 (removed 195) transitions.
[2023-03-20 15:03:59] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 22 cols
[2023-03-20 15:03:59] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-20 15:03:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 15:03:59] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-20 15:03:59] [INFO ] Invariant cache hit.
[2023-03-20 15:03:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2023-03-20 15:03:59] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2023-03-20 15:03:59] [INFO ] Invariant cache hit.
[2023-03-20 15:03:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 22/170 places, 29/224 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 175 ms. Remains : 22/170 places, 29/224 transitions.
Running random walk in product with property : SmartHome-PT-14-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s4 1), p0:(NEQ s6 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 64 steps with 11 reset in 1 ms.
Treatment of property SmartHome-PT-14-LTLFireability-06 finished in 447 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-20 15:03:59] [INFO ] Flatten gal took : 16 ms
[2023-03-20 15:03:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 15:03:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 224 transitions and 503 arcs took 3 ms.
Total runtime 19176 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1001/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SmartHome-PT-14-LTLFireability-06

BK_STOP 1679324641203

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SmartHome-PT-14-LTLFireability-06
ltl formula formula --ltl=/tmp/1001/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 170 places, 224 transitions and 503 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1001/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1001/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1001/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1001/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-14"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is SmartHome-PT-14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r457-smll-167912649100260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-14.tgz
mv SmartHome-PT-14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;