About the Execution of ITS-Tools for SmartHome-PT-15
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
319.460 | 17411.00 | 38294.00 | 302.20 | FFTTFFTFFTTTTFFT | normal |
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-165303241600307.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-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241600307
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 332K
-rw-r--r-- 1 mcc users 6.6K Apr 29 15:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 29 15:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 15:37 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 3.9K May 9 09:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 09:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 09:07 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 102K 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-15-LTLCardinality-00
FORMULA_NAME SmartHome-PT-15-LTLCardinality-01
FORMULA_NAME SmartHome-PT-15-LTLCardinality-02
FORMULA_NAME SmartHome-PT-15-LTLCardinality-03
FORMULA_NAME SmartHome-PT-15-LTLCardinality-04
FORMULA_NAME SmartHome-PT-15-LTLCardinality-05
FORMULA_NAME SmartHome-PT-15-LTLCardinality-06
FORMULA_NAME SmartHome-PT-15-LTLCardinality-07
FORMULA_NAME SmartHome-PT-15-LTLCardinality-08
FORMULA_NAME SmartHome-PT-15-LTLCardinality-09
FORMULA_NAME SmartHome-PT-15-LTLCardinality-10
FORMULA_NAME SmartHome-PT-15-LTLCardinality-11
FORMULA_NAME SmartHome-PT-15-LTLCardinality-12
FORMULA_NAME SmartHome-PT-15-LTLCardinality-13
FORMULA_NAME SmartHome-PT-15-LTLCardinality-14
FORMULA_NAME SmartHome-PT-15-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653109236737
Running Version 202205111006
[2022-05-21 05:00:39] [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:00:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 05:00:39] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2022-05-21 05:00:39] [INFO ] Transformed 427 places.
[2022-05-21 05:00:39] [INFO ] Transformed 451 transitions.
[2022-05-21 05:00:39] [INFO ] Found NUPN structural information;
[2022-05-21 05:00:39] [INFO ] Parsed PT model containing 427 places and 451 transitions in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 134 places in 16 ms
Reduce places removed 134 places and 107 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-15-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-15-LTLCardinality-14 FALSE 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 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 167 place count 208 transition count 262
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 182 place count 193 transition count 247
Iterating global reduction 2 with 15 rules applied. Total rules applied 197 place count 193 transition count 247
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 211 place count 179 transition count 233
Iterating global reduction 2 with 14 rules applied. Total rules applied 225 place count 179 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 227 place count 179 transition count 231
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 232 place count 174 transition count 226
Iterating global reduction 3 with 5 rules applied. Total rules applied 237 place count 174 transition count 226
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 172 transition count 224
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 172 transition count 224
Applied a total of 241 rules in 157 ms. Remains 172 /293 variables (removed 121) and now considering 224/344 (removed 120) transitions.
// Phase 1: matrix 224 rows 172 cols
[2022-05-21 05:00:40] [INFO ] Computed 3 place invariants in 28 ms
[2022-05-21 05:00:40] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 224 rows 172 cols
[2022-05-21 05:00:40] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 05:00:41] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
// Phase 1: matrix 224 rows 172 cols
[2022-05-21 05:00:41] [INFO ] Computed 3 place invariants in 6 ms
[2022-05-21 05:00:41] [INFO ] Dead Transitions using invariants and state equation in 357 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 172/293 places, 224/344 transitions.
Finished structural reductions, in 1 iterations. Remains : 172/293 places, 224/344 transitions.
Support contains 16 out of 172 places after structural reductions.
[2022-05-21 05:00:41] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-21 05:00:41] [INFO ] Flatten gal took : 99 ms
FORMULA SmartHome-PT-15-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-21 05:00:41] [INFO ] Flatten gal took : 39 ms
[2022-05-21 05:00:41] [INFO ] Input system was already deterministic with 224 transitions.
Incomplete random walk after 10000 steps, including 53 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 11) seen :10
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 172 cols
[2022-05-21 05:00:42] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 05:00:42] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 05:00:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-05-21 05:00:42] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-21 05:00:42] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA SmartHome-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 35 stabilizing places and 34 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 166 transition count 218
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 166 transition count 218
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 164 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 164 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 162 transition count 214
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 162 transition count 214
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 161 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 161 transition count 213
Applied a total of 22 rules in 31 ms. Remains 161 /172 variables (removed 11) and now considering 213/224 (removed 11) transitions.
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:43] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:43] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:43] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:43] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 161/172 places, 213/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/172 places, 213/224 transitions.
Stuttering acceptance computed with spot in 309 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s69 0) (EQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 453 ms.
Product exploration explored 100000 steps with 25000 reset in 337 ms.
Computed a total of 30 stabilizing places and 29 stable transitions
Computed a total of 30 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 284 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 376 steps, including 1 resets, run visited all 1 properties in 5 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 161 /161 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:45] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:45] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:46] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
// Phase 1: matrix 213 rows 161 cols
[2022-05-21 05:00:46] [INFO ] Computed 3 place invariants in 5 ms
[2022-05-21 05:00:46] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 161/161 places, 213/213 transitions.
Computed a total of 30 stabilizing places and 29 stable transitions
Computed a total of 30 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 754 steps, including 4 resets, run visited all 1 properties in 6 ms. (steps per millisecond=125 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 4 edges and 1 AP to 4 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Product exploration explored 100000 steps with 25000 reset in 224 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 213/213 transitions.
Graph (trivial) has 162 edges and 161 vertex of which 93 / 161 are part of one of the 8 SCC in 5 ms
Free SCC test removed 85 places
Ensure Unique test removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 76 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 76 transition count 97
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 25 place count 76 transition count 97
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 76 transition count 97
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 43 place count 61 transition count 82
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 58 place count 61 transition count 82
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 80 place count 61 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 61 transition count 81
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 90 place count 52 transition count 72
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 3 with 9 rules applied. Total rules applied 99 place count 52 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 52 transition count 72
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 50 transition count 70
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 50 transition count 70
Deduced a syphon composed of 24 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 117 place count 50 transition count 57
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 123 edges and 48 vertex of which 46 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 120 place count 46 transition count 55
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 44 transition count 52
Deduced a syphon composed of 21 places in 1 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 44 transition count 52
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 124 rules in 75 ms. Remains 44 /161 variables (removed 117) and now considering 52/213 (removed 161) transitions.
[2022-05-21 05:00:48] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-21 05:00:48] [INFO ] Flow matrix only has 46 transitions (discarded 6 similar events)
// Phase 1: matrix 46 rows 44 cols
[2022-05-21 05:00:48] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:00:48] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/161 places, 52/213 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/161 places, 52/213 transitions.
Product exploration explored 100000 steps with 25000 reset in 621 ms.
Product exploration explored 100000 steps with 25000 reset in 343 ms.
Built C files in :
/tmp/ltsmin13508795039995133434
[2022-05-21 05:00:49] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13508795039995133434
Running compilation step : cd /tmp/ltsmin13508795039995133434;'/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 663 ms.
Running link step : cd /tmp/ltsmin13508795039995133434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin13508795039995133434;'/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/stateBased9728693658938670690.hoa' '--buchi-type=spotba'
LTSmin run took 204 ms.
FORMULA SmartHome-PT-15-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property SmartHome-PT-15-LTLCardinality-03 finished in 7365 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 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Graph (trivial) has 173 edges and 172 vertex of which 105 / 172 are part of one of the 8 SCC in 0 ms
Free SCC test removed 97 places
Ensure Unique test removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 74 transition count 77
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 57 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 56 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 56 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 52 transition count 72
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 91 place count 29 transition count 47
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 28 transition count 46
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 28 transition count 46
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 104 place count 28 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 105 place count 27 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 105 place count 27 transition count 34
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 107 place count 26 transition count 34
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 108 place count 25 transition count 32
Iterating global reduction 4 with 1 rules applied. Total rules applied 109 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 24 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 111 place count 23 transition count 31
Applied a total of 111 rules in 18 ms. Remains 23 /172 variables (removed 149) and now considering 31/224 (removed 193) transitions.
[2022-05-21 05:00:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:00:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:00:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-05-21 05:00:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:00:50] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:00:50] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-21 05:00:50] [INFO ] Redundant transitions in 33 ms returned []
[2022-05-21 05:00:50] [INFO ] Flow matrix only has 25 transitions (discarded 6 similar events)
// Phase 1: matrix 25 rows 23 cols
[2022-05-21 05:00:50] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:00:50] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 23/172 places, 31/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 23/172 places, 31/224 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-04 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:(OR (EQ s8 0) (EQ s4 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 3 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-15-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-15-LTLCardinality-04 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 164 transition count 216
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 164 transition count 216
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 161 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 161 transition count 213
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 158 transition count 210
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 158 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 157 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 157 transition count 209
Applied a total of 30 rules in 25 ms. Remains 157 /172 variables (removed 15) and now considering 209/224 (removed 15) transitions.
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 05:00:50] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:50] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 05:00:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:50] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 209 rows 157 cols
[2022-05-21 05:00:50] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:51] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 157/172 places, 209/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 157/172 places, 209/224 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s72 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-15-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-15-LTLCardinality-07 finished in 660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 165 transition count 217
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 165 transition count 217
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 162 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 162 transition count 214
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 159 transition count 211
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 159 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 158 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 158 transition count 210
Applied a total of 28 rules in 47 ms. Remains 158 /172 variables (removed 14) and now considering 210/224 (removed 14) transitions.
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 05:00:51] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-21 05:00:51] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 05:00:51] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-21 05:00:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 210 rows 158 cols
[2022-05-21 05:00:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:51] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/172 places, 210/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/172 places, 210/224 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s59 0) (EQ s19 1)), p0:(OR (EQ s48 0) (EQ s139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 254 ms.
Product exploration explored 100000 steps with 50000 reset in 167 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 (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 7 factoid took 116 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-15-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-15-LTLCardinality-09 finished in 1257 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&((F(p0)||p2) U X(p0))))'
Support contains 4 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 167 transition count 219
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 167 transition count 219
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 166 transition count 218
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 166 transition count 218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 165 transition count 217
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 165 transition count 217
Applied a total of 14 rules in 10 ms. Remains 165 /172 variables (removed 7) and now considering 217/224 (removed 7) transitions.
// Phase 1: matrix 217 rows 165 cols
[2022-05-21 05:00:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:52] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 217 rows 165 cols
[2022-05-21 05:00:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 217 rows 165 cols
[2022-05-21 05:00:52] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-21 05:00:52] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 165/172 places, 217/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 165/172 places, 217/224 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0)]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s71 0) (EQ s72 1)), p0:(OR (EQ s35 0) (EQ s38 1))], nbAcceptance=0, 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 283 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Computed a total of 33 stabilizing places and 32 stable transitions
Computed a total of 33 stabilizing places and 32 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA SmartHome-PT-15-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-15-LTLCardinality-10 finished in 1195 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p1)||p0)))'
Support contains 3 out of 172 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 172/172 places, 224/224 transitions.
Graph (trivial) has 169 edges and 172 vertex of which 96 / 172 are part of one of the 8 SCC in 0 ms
Free SCC test removed 88 places
Ensure Unique test removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 83 transition count 82
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 59 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 49 place count 59 transition count 78
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 55 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 54 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 54 transition count 77
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 2 with 2 rules applied. Total rules applied 61 place count 54 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 53 transition count 75
Performed 23 Post agglomeration using F-continuation condition with reduction of 1 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 108 place count 30 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 109 place count 30 transition count 50
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 29 transition count 49
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 29 transition count 49
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 123 place count 29 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 124 place count 28 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 124 place count 28 transition count 36
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 126 place count 27 transition count 36
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 127 place count 26 transition count 34
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 26 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 25 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 130 place count 24 transition count 33
Applied a total of 130 rules in 31 ms. Remains 24 /172 variables (removed 148) and now considering 33/224 (removed 191) transitions.
[2022-05-21 05:00:53] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
// Phase 1: matrix 27 rows 24 cols
[2022-05-21 05:00:53] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-21 05:00:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-05-21 05:00:53] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
// Phase 1: matrix 27 rows 24 cols
[2022-05-21 05:00:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:00:53] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-21 05:00:53] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-21 05:00:53] [INFO ] Flow matrix only has 27 transitions (discarded 6 similar events)
// Phase 1: matrix 27 rows 24 cols
[2022-05-21 05:00:53] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-21 05:00:53] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/172 places, 33/224 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/172 places, 33/224 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-15-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s8 1), p0:(OR (EQ s5 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-15-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-15-LTLCardinality-13 finished in 262 ms.
All properties solved by simple procedures.
Total runtime 14863 ms.
BK_STOP 1653109254148
--------------------
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-15"
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-15, 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-165303241600307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-15.tgz
mv SmartHome-PT-15 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;