About the Execution of ITS-Tools for SmartHome-PT-10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
285.731 | 9591.00 | 18733.00 | 156.10 | FFFTFFFTFTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r254-tall-162106745700228.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SmartHome-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r254-tall-162106745700228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 13:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 13:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 19:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 19:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 68K May 5 16:52 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-10-00
FORMULA_NAME SmartHome-PT-10-01
FORMULA_NAME SmartHome-PT-10-02
FORMULA_NAME SmartHome-PT-10-03
FORMULA_NAME SmartHome-PT-10-04
FORMULA_NAME SmartHome-PT-10-05
FORMULA_NAME SmartHome-PT-10-06
FORMULA_NAME SmartHome-PT-10-07
FORMULA_NAME SmartHome-PT-10-08
FORMULA_NAME SmartHome-PT-10-09
FORMULA_NAME SmartHome-PT-10-10
FORMULA_NAME SmartHome-PT-10-11
FORMULA_NAME SmartHome-PT-10-12
FORMULA_NAME SmartHome-PT-10-13
FORMULA_NAME SmartHome-PT-10-14
FORMULA_NAME SmartHome-PT-10-15
=== Now, execution of the tool begins
BK_START 1621167421180
Running Version 0
[2021-05-16 12:17:02] [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]
[2021-05-16 12:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 12:17:02] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2021-05-16 12:17:02] [INFO ] Transformed 273 places.
[2021-05-16 12:17:02] [INFO ] Transformed 308 transitions.
[2021-05-16 12:17:02] [INFO ] Found NUPN structural information;
[2021-05-16 12:17:02] [INFO ] Parsed PT model containing 273 places and 308 transitions in 96 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 12:17:02] [INFO ] Initial state test concluded for 3 properties.
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 233 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 183 transition count 213
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 183 transition count 213
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 103 place count 183 transition count 210
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 113 place count 173 transition count 200
Iterating global reduction 1 with 10 rules applied. Total rules applied 123 place count 173 transition count 200
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 130 place count 166 transition count 193
Iterating global reduction 1 with 7 rules applied. Total rules applied 137 place count 166 transition count 193
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 140 place count 163 transition count 190
Iterating global reduction 1 with 3 rules applied. Total rules applied 143 place count 163 transition count 190
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 144 place count 162 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 145 place count 162 transition count 189
Applied a total of 145 rules in 66 ms. Remains 162 /233 variables (removed 71) and now considering 189/263 (removed 74) transitions.
// Phase 1: matrix 189 rows 162 cols
[2021-05-16 12:17:03] [INFO ] Computed 12 place invariants in 15 ms
[2021-05-16 12:17:03] [INFO ] Implicit Places using invariants in 143 ms returned []
// Phase 1: matrix 189 rows 162 cols
[2021-05-16 12:17:03] [INFO ] Computed 12 place invariants in 7 ms
[2021-05-16 12:17:03] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 162 cols
[2021-05-16 12:17:03] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-16 12:17:03] [INFO ] Dead Transitions using invariants and state equation in 101 ms returned []
Finished structural reductions, in 1 iterations. Remains : 162/233 places, 189/263 transitions.
[2021-05-16 12:17:03] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-16 12:17:03] [INFO ] Flatten gal took : 40 ms
FORMULA SmartHome-PT-10-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 12:17:03] [INFO ] Flatten gal took : 15 ms
[2021-05-16 12:17:03] [INFO ] Input system was already deterministic with 189 transitions.
Incomplete random walk after 100000 steps, including 744 resets, run finished after 326 ms. (steps per millisecond=306 ) properties (out of 12) seen :6
Running SMT prover for 6 properties.
// Phase 1: matrix 189 rows 162 cols
[2021-05-16 12:17:03] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-16 12:17:03] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:03] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:04] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2021-05-16 12:17:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-16 12:17:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 2 ms to minimize.
[2021-05-16 12:17:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-16 12:17:04] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-16 12:17:04] [INFO ] Deduced a trap composed of 37 places in 24 ms of which 1 ms to minimize.
[2021-05-16 12:17:04] [INFO ] Deduced a trap composed of 37 places in 25 ms of which 1 ms to minimize.
[2021-05-16 12:17:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 85 ms
[2021-05-16 12:17:04] [INFO ] Added : 188 causal constraints over 38 iterations in 574 ms. Result :sat
[2021-05-16 12:17:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:04] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-16 12:17:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:04] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-16 12:17:04] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-16 12:17:05] [INFO ] Deduced a trap composed of 37 places in 22 ms of which 1 ms to minimize.
[2021-05-16 12:17:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-16 12:17:05] [INFO ] Added : 187 causal constraints over 38 iterations in 467 ms. Result :sat
[2021-05-16 12:17:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:05] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-16 12:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:05] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-16 12:17:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:05] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:05] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-16 12:17:05] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2021-05-16 12:17:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2021-05-16 12:17:05] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-16 12:17:06] [INFO ] Added : 188 causal constraints over 38 iterations in 407 ms. Result :sat
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 40 places in 22 ms of which 1 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 38 places in 17 ms of which 1 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2021-05-16 12:17:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 40 places in 25 ms of which 0 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 38 places in 20 ms of which 0 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2021-05-16 12:17:06] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-16 12:17:06] [INFO ] Added : 188 causal constraints over 38 iterations in 476 ms. Result :sat
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:06] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 40 places in 25 ms of which 0 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Deduced a trap composed of 38 places in 26 ms of which 0 ms to minimize.
[2021-05-16 12:17:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 69 ms
[2021-05-16 12:17:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-16 12:17:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:06] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-16 12:17:07] [INFO ] Deduced a trap composed of 40 places in 22 ms of which 1 ms to minimize.
[2021-05-16 12:17:07] [INFO ] Deduced a trap composed of 38 places in 18 ms of which 1 ms to minimize.
[2021-05-16 12:17:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2021-05-16 12:17:07] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-16 12:17:07] [INFO ] Deduced a trap composed of 33 places in 16 ms of which 0 ms to minimize.
[2021-05-16 12:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2021-05-16 12:17:07] [INFO ] Added : 188 causal constraints over 38 iterations in 464 ms. Result :sat
[2021-05-16 12:17:07] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:07] [INFO ] [Real]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 12:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:07] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2021-05-16 12:17:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 12:17:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-16 12:17:07] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-16 12:17:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 12:17:07] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-16 12:17:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2021-05-16 12:17:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2021-05-16 12:17:07] [INFO ] Computed and/alt/rep : 188/332/188 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-16 12:17:08] [INFO ] Deduced a trap composed of 25 places in 17 ms of which 1 ms to minimize.
[2021-05-16 12:17:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2021-05-16 12:17:08] [INFO ] Added : 188 causal constraints over 38 iterations in 466 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (p1||G(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Graph (trivial) has 146 edges and 162 vertex of which 84 / 162 are part of one of the 6 SCC in 10 ms
Free SCC test removed 78 places
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 83 transition count 73
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 70 transition count 71
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 31 place count 69 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 32 place count 68 transition count 70
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 32 place count 68 transition count 65
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 42 place count 63 transition count 65
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 45 place count 60 transition count 62
Iterating global reduction 4 with 3 rules applied. Total rules applied 48 place count 60 transition count 62
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
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 82 place count 43 transition count 45
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 87 place count 43 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 42 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 89 place count 41 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 40 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 91 place count 39 transition count 38
Applied a total of 91 rules in 39 ms. Remains 39 /162 variables (removed 123) and now considering 38/189 (removed 151) transitions.
[2021-05-16 12:17:08] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2021-05-16 12:17:08] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants in 53 ms returned []
[2021-05-16 12:17:08] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2021-05-16 12:17:08] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 12:17:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2021-05-16 12:17:08] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 12:17:08] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 39 cols
[2021-05-16 12:17:08] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 12:17:08] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/162 places, 38/189 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NEQ s8 0) (NEQ s14 1) (NEQ s1 0)), p0:(NEQ s1 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-01 finished in 365 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((G(p0)||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 151 transition count 178
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 151 transition count 178
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 147 transition count 174
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 147 transition count 174
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 145 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 145 transition count 172
Applied a total of 34 rules in 14 ms. Remains 145 /162 variables (removed 17) and now considering 172/189 (removed 17) transitions.
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 10 ms
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:08] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/162 places, 172/189 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : SmartHome-PT-10-02 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s50 0) (EQ s54 1)), p1:(AND (NEQ s54 0) (NEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-02 finished in 354 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 150 transition count 177
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 150 transition count 177
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 146 transition count 173
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 146 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 144 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 144 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 143 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 143 transition count 170
Applied a total of 38 rules in 12 ms. Remains 143 /162 variables (removed 19) and now considering 170/189 (removed 19) transitions.
// Phase 1: matrix 170 rows 143 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 170 rows 143 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-16 12:17:08] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 170 rows 143 cols
[2021-05-16 12:17:08] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/162 places, 170/189 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-10-05 automaton TGBA [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:(AND (NEQ s42 0) (NEQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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-10-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-05 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Graph (trivial) has 148 edges and 162 vertex of which 76 / 162 are part of one of the 6 SCC in 0 ms
Free SCC test removed 70 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 91 transition count 79
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 73 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 72 transition count 77
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 40 place count 72 transition count 72
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 50 place count 67 transition count 72
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 54 place count 63 transition count 68
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 63 transition count 68
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 102 place count 41 transition count 44
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 108 place count 41 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 110 place count 39 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 111 place count 38 transition count 37
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 112 place count 37 transition count 36
Applied a total of 112 rules in 16 ms. Remains 37 /162 variables (removed 125) and now considering 36/189 (removed 153) transitions.
[2021-05-16 12:17:09] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2021-05-16 12:17:09] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants in 18 ms returned []
[2021-05-16 12:17:09] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2021-05-16 12:17:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-16 12:17:09] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-16 12:17:09] [INFO ] Flow matrix only has 31 transitions (discarded 5 similar events)
// Phase 1: matrix 31 rows 37 cols
[2021-05-16 12:17:09] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-16 12:17:09] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/162 places, 36/189 transitions.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Running random walk in product with property : SmartHome-PT-10-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s7 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-10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-06 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((G(p2)||p1)&&p0))))], workingDir=/home/mcc/execution]
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 152 transition count 179
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 152 transition count 179
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 148 transition count 175
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 148 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 146 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 146 transition count 173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 145 transition count 172
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 145 transition count 172
Applied a total of 34 rules in 11 ms. Remains 145 /162 variables (removed 17) and now considering 172/189 (removed 17) transitions.
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
// Phase 1: matrix 172 rows 145 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 12:17:09] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/162 places, 172/189 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), true]
Running random walk in product with property : SmartHome-PT-10-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (NEQ s54 0) (NEQ s86 1)), p1:(OR (NEQ s7 0) (NEQ s11 1)), p2:(OR (EQ s124 0) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, 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 0 ms.
FORMULA SmartHome-PT-10-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-11 finished in 282 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(F((p1&&F(p2))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 162/162 places, 189/189 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 153 transition count 180
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 153 transition count 180
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 150 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 150 transition count 177
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 149 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 149 transition count 176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 148 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 148 transition count 175
Applied a total of 28 rules in 20 ms. Remains 148 /162 variables (removed 14) and now considering 175/189 (removed 14) transitions.
// Phase 1: matrix 175 rows 148 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 175 rows 148 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
// Phase 1: matrix 175 rows 148 cols
[2021-05-16 12:17:09] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-16 12:17:09] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 148/162 places, 175/189 transitions.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : SmartHome-PT-10-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s50 1) (EQ s29 1)), p1:(OR (EQ s50 1) (EQ s29 1)), p2:(OR (EQ s59 0) (EQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 88 steps with 0 reset in 2 ms.
FORMULA SmartHome-PT-10-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-10-15 finished in 291 ms.
All properties solved without resorting to model-checking.
BK_STOP 1621167430771
--------------------
content from stderr:
+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="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-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r254-tall-162106745700228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-10.tgz
mv SmartHome-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;