About the Execution of ITS-Tools for SmartHome-PT-08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 717.504 | 92719.00 | 115629.00 | 679.30 | FFTFTFFTTFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r453-smll-167912645100210.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SmartHome-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r453-smll-167912645100210
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.9K Feb 26 05:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 05:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 05:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 05:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 64K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmartHome-PT-08-CTLFireability-00
FORMULA_NAME SmartHome-PT-08-CTLFireability-01
FORMULA_NAME SmartHome-PT-08-CTLFireability-02
FORMULA_NAME SmartHome-PT-08-CTLFireability-03
FORMULA_NAME SmartHome-PT-08-CTLFireability-04
FORMULA_NAME SmartHome-PT-08-CTLFireability-05
FORMULA_NAME SmartHome-PT-08-CTLFireability-06
FORMULA_NAME SmartHome-PT-08-CTLFireability-07
FORMULA_NAME SmartHome-PT-08-CTLFireability-08
FORMULA_NAME SmartHome-PT-08-CTLFireability-09
FORMULA_NAME SmartHome-PT-08-CTLFireability-10
FORMULA_NAME SmartHome-PT-08-CTLFireability-11
FORMULA_NAME SmartHome-PT-08-CTLFireability-12
FORMULA_NAME SmartHome-PT-08-CTLFireability-13
FORMULA_NAME SmartHome-PT-08-CTLFireability-14
FORMULA_NAME SmartHome-PT-08-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679245222596
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-08
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202303021504
[2023-03-19 17:00:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 17:00:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 17:00:26] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-19 17:00:26] [INFO ] Transformed 252 places.
[2023-03-19 17:00:26] [INFO ] Transformed 291 transitions.
[2023-03-19 17:00:26] [INFO ] Found NUPN structural information;
[2023-03-19 17:00:26] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 21 transitions.
FORMULA SmartHome-PT-08-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 270/270 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 185 transition count 223
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 185 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 97 place count 185 transition count 220
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 179 transition count 214
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 179 transition count 214
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 176 transition count 211
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 176 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 116 place count 175 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 117 place count 175 transition count 210
Applied a total of 117 rules in 114 ms. Remains 175 /232 variables (removed 57) and now considering 210/270 (removed 60) transitions.
// Phase 1: matrix 210 rows 175 cols
[2023-03-19 17:00:26] [INFO ] Computed 11 place invariants in 23 ms
[2023-03-19 17:00:27] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-03-19 17:00:27] [INFO ] Invariant cache hit.
[2023-03-19 17:00:27] [INFO ] Implicit Places using invariants and state equation in 269 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2023-03-19 17:00:27] [INFO ] Invariant cache hit.
[2023-03-19 17:00:27] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 175/232 places, 210/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 175/232 places, 210/270 transitions.
Support contains 80 out of 175 places after structural reductions.
[2023-03-19 17:00:27] [INFO ] Flatten gal took : 68 ms
[2023-03-19 17:00:27] [INFO ] Flatten gal took : 24 ms
[2023-03-19 17:00:28] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 79 out of 175 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 892 ms. (steps per millisecond=11 ) properties (out of 59) seen :49
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-19 17:00:29] [INFO ] Invariant cache hit.
[2023-03-19 17:00:29] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2023-03-19 17:00:29] [INFO ] After 176ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:5
[2023-03-19 17:00:30] [INFO ] After 229ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :1 real:6
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-19 17:00:30] [INFO ] After 528ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:7
[2023-03-19 17:00:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-19 17:00:30] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-19 17:00:30] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2023-03-19 17:00:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-19 17:00:30] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2023-03-19 17:00:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2023-03-19 17:00:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-19 17:00:30] [INFO ] After 491ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-19 17:00:30] [INFO ] After 706ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 3 properties in 35 ms.
Support contains 16 out of 175 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 144 edges and 175 vertex of which 54 / 175 are part of one of the 4 SCC in 3 ms
Free SCC test removed 50 places
Drop transitions removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 125 transition count 109
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 36 rules applied. Total rules applied 70 place count 92 transition count 106
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 72 place count 91 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 90 transition count 105
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 73 place count 90 transition count 98
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 87 place count 83 transition count 98
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 98 place count 72 transition count 87
Iterating global reduction 4 with 11 rules applied. Total rules applied 109 place count 72 transition count 87
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 114 place count 72 transition count 82
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 70 transition count 80
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 70 transition count 80
Performed 26 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 170 place count 44 transition count 50
Drop transitions removed 5 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 178 place count 44 transition count 42
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 182 place count 44 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 183 place count 43 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 184 place count 42 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 185 place count 41 transition count 37
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 187 place count 41 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 189 place count 39 transition count 35
Applied a total of 189 rules in 42 ms. Remains 39 /175 variables (removed 136) and now considering 35/210 (removed 175) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 39/175 places, 35/210 transitions.
Incomplete random walk after 10000 steps, including 487 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 222 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 35 rows 39 cols
[2023-03-19 17:00:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:00:31] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-19 17:00:31] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-19 17:00:31] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 17:00:31] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-19 17:00:31] [INFO ] After 13ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 17:00:31] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:2
[2023-03-19 17:00:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-19 17:00:31] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 17:00:31] [INFO ] After 14ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 17:00:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2023-03-19 17:00:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-19 17:00:31] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-19 17:00:31] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 13 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 35/35 transitions.
Graph (trivial) has 3 edges and 39 vertex of which 2 / 39 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 38 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 36 transition count 31
Applied a total of 5 rules in 4 ms. Remains 36 /39 variables (removed 3) and now considering 31/35 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 36/39 places, 31/35 transitions.
Incomplete random walk after 10000 steps, including 584 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 247 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Finished probabilistic random walk after 10345 steps, run visited all 3 properties in 57 ms. (steps per millisecond=181 )
Probabilistic random walk after 10345 steps, saw 2208 distinct states, run finished after 57 ms. (steps per millisecond=181 ) properties seen :3
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-19 17:00:31] [INFO ] Flatten gal took : 15 ms
[2023-03-19 17:00:31] [INFO ] Flatten gal took : 14 ms
[2023-03-19 17:00:31] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 71 out of 175 places (down from 75) after GAL structural reductions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 151 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 151 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 50 place count 151 transition count 184
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 141 transition count 174
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 141 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 141 transition count 173
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 77 place count 135 transition count 167
Iterating global reduction 2 with 6 rules applied. Total rules applied 83 place count 135 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 134 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 134 transition count 166
Applied a total of 85 rules in 17 ms. Remains 134 /175 variables (removed 41) and now considering 166/210 (removed 44) transitions.
// Phase 1: matrix 166 rows 134 cols
[2023-03-19 17:00:31] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-19 17:00:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 17:00:32] [INFO ] Invariant cache hit.
[2023-03-19 17:00:32] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-19 17:00:32] [INFO ] Invariant cache hit.
[2023-03-19 17:00:32] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/175 places, 166/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 134/175 places, 166/210 transitions.
[2023-03-19 17:00:32] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:00:32] [INFO ] Flatten gal took : 11 ms
[2023-03-19 17:00:32] [INFO ] Input system was already deterministic with 166 transitions.
[2023-03-19 17:00:32] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:00:32] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:00:32] [INFO ] Time to serialize gal into /tmp/CTLFireability43990042973349099.gal : 4 ms
[2023-03-19 17:00:32] [INFO ] Time to serialize properties into /tmp/CTLFireability891526026635612006.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability43990042973349099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability891526026635612006.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...280
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.50895e+09,0.293238,13208,2,2828,5,45790,6,0,704,41956,0
Converting to forward existential form...Done !
original formula: E(EX((EG((p133==1)) + (p88==1))) U !(((((((A((p169==1) U (p166==1)) * !(((p66==1)||(p155==1)))) * (p29!=1)) + (p4==1)) * EF(((p185==1)&&(...230
=> equivalent forward existential formula: [FwdG((FwdU(Init,EX((EG((p133==1)) + (p88==1)))) * !((((((!((E(!((p166==1)) U (!((p169==1)) * !((p166==1)))) + E...324
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t84, t105, t139, t140, Intersection with reachable at each step enab...208
(forward)formula 0,0,8.16648,238636,1,0,687,1.51689e+06,391,387,4223,1.32747e+06,878
FORMULA SmartHome-PT-08-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 151 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 151 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 151 transition count 183
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 141 transition count 173
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 141 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 141 transition count 172
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 79 place count 134 transition count 165
Iterating global reduction 2 with 7 rules applied. Total rules applied 86 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 133 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 133 transition count 164
Applied a total of 88 rules in 16 ms. Remains 133 /175 variables (removed 42) and now considering 164/210 (removed 46) transitions.
// Phase 1: matrix 164 rows 133 cols
[2023-03-19 17:00:40] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 17:00:40] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-19 17:00:40] [INFO ] Invariant cache hit.
[2023-03-19 17:00:40] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-19 17:00:40] [INFO ] Invariant cache hit.
[2023-03-19 17:00:41] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 133/175 places, 164/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 378 ms. Remains : 133/175 places, 164/210 transitions.
[2023-03-19 17:00:41] [INFO ] Flatten gal took : 11 ms
[2023-03-19 17:00:41] [INFO ] Flatten gal took : 11 ms
[2023-03-19 17:00:41] [INFO ] Input system was already deterministic with 164 transitions.
[2023-03-19 17:00:41] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:00:41] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:00:41] [INFO ] Time to serialize gal into /tmp/CTLFireability534454016822299663.gal : 4 ms
[2023-03-19 17:00:41] [INFO ] Time to serialize properties into /tmp/CTLFireability7504275901594234056.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability534454016822299663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7504275901594234056.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.30112e+09,0.49158,13532,2,2738,5,47362,6,0,698,42293,0
Converting to forward existential form...Done !
original formula: AG(E(!(EG((AF((p39==1)) * (p153!=1)))) U (EX(EG((p217==1))) + (p224!=1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG((!(EG(!((p39==1)))) * (p153!=1)))) U (EX(EG((p217==1))) + (p224!=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t11, t13, t33, t65, t85, t105, t139, Intersection with reachable at each step enabl...207
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,8.41784,244988,1,0,651,1.50256e+06,367,386,4167,1.46113e+06,849
FORMULA SmartHome-PT-08-CTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 153 transition count 188
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 153 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 153 transition count 187
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 55 place count 143 transition count 177
Iterating global reduction 1 with 10 rules applied. Total rules applied 65 place count 143 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 143 transition count 176
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 73 place count 136 transition count 169
Iterating global reduction 2 with 7 rules applied. Total rules applied 80 place count 136 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 135 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 135 transition count 168
Applied a total of 82 rules in 15 ms. Remains 135 /175 variables (removed 40) and now considering 168/210 (removed 42) transitions.
// Phase 1: matrix 168 rows 135 cols
[2023-03-19 17:00:49] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-19 17:00:49] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-19 17:00:49] [INFO ] Invariant cache hit.
[2023-03-19 17:00:49] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-19 17:00:49] [INFO ] Invariant cache hit.
[2023-03-19 17:00:49] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/175 places, 168/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 135/175 places, 168/210 transitions.
[2023-03-19 17:00:49] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:00:49] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:00:49] [INFO ] Input system was already deterministic with 168 transitions.
[2023-03-19 17:00:49] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:00:49] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability8934019170697713592.gal : 2 ms
[2023-03-19 17:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability888032502043163343.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8934019170697713592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability888032502043163343.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.86806e+09,0.710069,26712,2,3937,5,105442,6,0,710,103628,0
Converting to forward existential form...Done !
original formula: EF(AX(((p5==1) + AF(((((p12==1)||(p26==1))&&(p26==1))&&(p82==1))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((p5==1) + !(EG(!(((((p12==1)||(p26==1))&&(p26==1))&&(p82==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t10, t12, t32, t64, t84, t102, t105, t139, t140, t141, Intersection with reachable a...225
(forward)formula 0,1,12.8535,351048,1,0,610,2.19042e+06,360,343,4034,1.9678e+06,764
FORMULA SmartHome-PT-08-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 137 edges and 175 vertex of which 21 / 175 are part of one of the 2 SCC in 2 ms
Free SCC test removed 19 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 155 transition count 132
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 61 rules applied. Total rules applied 114 place count 103 transition count 123
Reduce places removed 5 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 2 with 7 rules applied. Total rules applied 121 place count 98 transition count 121
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 97 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 96 transition count 120
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 124 place count 96 transition count 113
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 138 place count 89 transition count 113
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 154 place count 73 transition count 97
Iterating global reduction 5 with 16 rules applied. Total rules applied 170 place count 73 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 with 7 rules applied. Total rules applied 177 place count 73 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 178 place count 72 transition count 90
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 180 place count 70 transition count 88
Iterating global reduction 7 with 2 rules applied. Total rules applied 182 place count 70 transition count 88
Performed 19 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 7 with 38 rules applied. Total rules applied 220 place count 51 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 6 rules applied. Total rules applied 226 place count 51 transition count 62
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 230 place count 49 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 232 place count 48 transition count 59
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 238 place count 48 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 239 place count 47 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 240 place count 46 transition count 52
Applied a total of 240 rules in 40 ms. Remains 46 /175 variables (removed 129) and now considering 52/210 (removed 158) transitions.
[2023-03-19 17:01:02] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
// Phase 1: matrix 51 rows 46 cols
[2023-03-19 17:01:02] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-19 17:01:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 17:01:03] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
[2023-03-19 17:01:03] [INFO ] Invariant cache hit.
[2023-03-19 17:01:03] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 17:01:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:01:03] [INFO ] Flow matrix only has 51 transitions (discarded 1 similar events)
[2023-03-19 17:01:03] [INFO ] Invariant cache hit.
[2023-03-19 17:01:03] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 46/175 places, 52/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 198 ms. Remains : 46/175 places, 52/210 transitions.
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 25 ms
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:01:03] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability14366131290123530548.gal : 1 ms
[2023-03-19 17:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7146897306051464118.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14366131290123530548.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7146897306051464118.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,138024,0.018812,4000,2,299,5,2448,6,0,236,1876,0
Converting to forward existential form...Done !
original formula: E(!((EG((AF((p217==1)) * ((((p185==1)&&(p222==1))||((p45==1)&&(p222==1)))||((p107==1)||(p162==1))))) + E(E(!(((((p21==1)&&(p52==1))&&((p8...269
=> equivalent forward existential formula: [(FwdU(Init,!((EG((!(EG(!((p217==1)))) * ((((p185==1)&&(p222==1))||((p45==1)&&(p222==1)))||((p107==1)||(p162==1)...321
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 47/0/5
Using saturation style SCC detection
Hit Full ! (commute/partial/dont) 44/0/8
(forward)formula 0,0,0.161204,9280,1,0,42,38376,50,25,1321,27752,36
FORMULA SmartHome-PT-08-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 152 transition count 187
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 152 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 152 transition count 185
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 143 transition count 176
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 143 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 143 transition count 175
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 137 transition count 169
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 137 transition count 169
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 136 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 136 transition count 168
Applied a total of 81 rules in 11 ms. Remains 136 /175 variables (removed 39) and now considering 168/210 (removed 42) transitions.
// Phase 1: matrix 168 rows 136 cols
[2023-03-19 17:01:03] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 17:01:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-19 17:01:03] [INFO ] Invariant cache hit.
[2023-03-19 17:01:03] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2023-03-19 17:01:03] [INFO ] Invariant cache hit.
[2023-03-19 17:01:03] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/175 places, 168/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 136/175 places, 168/210 transitions.
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 26 ms
[2023-03-19 17:01:03] [INFO ] Input system was already deterministic with 168 transitions.
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:01:03] [INFO ] Flatten gal took : 10 ms
[2023-03-19 17:01:03] [INFO ] Time to serialize gal into /tmp/CTLFireability18133194032134578252.gal : 2 ms
[2023-03-19 17:01:03] [INFO ] Time to serialize properties into /tmp/CTLFireability16721429581978672738.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability18133194032134578252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16721429581978672738.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.17299e+09,0.334201,13556,2,2938,5,47152,6,0,714,42385,0
Converting to forward existential form...Done !
original formula: E(!(EX(((p185==1)&&(p250==1)))) U ((p249==1) + (((p195!=1) * !(AG(((p2==1)&&(p107==1))))) * ((p6==1)&&(p176==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,!(EX(((p185==1)&&(p250==1))))) * (p249==1))] != FALSE + [(FwdU(((FwdU(Init,!(EX(((p185==1)&&(p250==...242
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t35, t67, t87, t107, t141, t142, Intersection with reachable at each step enab...208
(forward)formula 0,1,15.2583,419400,1,0,496,1.52619e+06,357,351,4038,3.27761e+06,660
FORMULA SmartHome-PT-08-CTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 154 edges and 175 vertex of which 44 / 175 are part of one of the 5 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 135 transition count 116
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 53 rules applied. Total rules applied 97 place count 92 transition count 106
Reduce places removed 5 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 2 with 7 rules applied. Total rules applied 104 place count 87 transition count 104
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 106 place count 86 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 85 transition count 103
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 107 place count 85 transition count 95
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 123 place count 77 transition count 95
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 134 place count 66 transition count 84
Iterating global reduction 5 with 11 rules applied. Total rules applied 145 place count 66 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 148 place count 66 transition count 81
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 6 with 34 rules applied. Total rules applied 182 place count 49 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 184 place count 49 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 188 place count 47 transition count 60
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 194 place count 47 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 47 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 196 place count 46 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 197 place count 45 transition count 52
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 17 edges and 44 vertex of which 2 / 44 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 9 with 2 rules applied. Total rules applied 199 place count 43 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 201 place count 43 transition count 50
Applied a total of 201 rules in 26 ms. Remains 43 /175 variables (removed 132) and now considering 50/210 (removed 160) transitions.
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
// Phase 1: matrix 43 rows 43 cols
[2023-03-19 17:01:19] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-19 17:01:19] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2023-03-19 17:01:19] [INFO ] Invariant cache hit.
[2023-03-19 17:01:19] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-19 17:01:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 43 transitions (discarded 7 similar events)
[2023-03-19 17:01:19] [INFO ] Invariant cache hit.
[2023-03-19 17:01:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/175 places, 50/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 198 ms. Remains : 43/175 places, 50/210 transitions.
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Input system was already deterministic with 50 transitions.
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9890765148807215326.gal : 1 ms
[2023-03-19 17:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17798778627050830037.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9890765148807215326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17798778627050830037.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,122976,0.014569,3660,2,281,5,1608,6,0,219,1239,0
Converting to forward existential form...Done !
original formula: !(E((((AG((p64==1)) + !(((p202==1)||(p127==1)))) + (p174==1)) * !(((p185==1)&&(p222==1)))) U E((p116==1) U (p128==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(((!(E(TRUE U !((p64==1)))) + !(((p202==1)||(p127==1)))) + (p174==1)) * !(((p185==1)&&(p222==1)...192
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 48/0/2
(forward)formula 0,0,0.158847,9520,1,0,84,28768,32,74,1159,43672,117
FORMULA SmartHome-PT-08-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 167 edges and 175 vertex of which 55 / 175 are part of one of the 5 SCC in 0 ms
Free SCC test removed 50 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 124 transition count 100
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 57 rules applied. Total rules applied 102 place count 80 transition count 87
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 11 rules applied. Total rules applied 113 place count 73 transition count 83
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 71 transition count 82
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 70 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 118 place count 70 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 132 place count 63 transition count 74
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 143 place count 52 transition count 63
Iterating global reduction 5 with 11 rules applied. Total rules applied 154 place count 52 transition count 63
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 157 place count 52 transition count 60
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 6 with 34 rules applied. Total rules applied 191 place count 35 transition count 43
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 193 place count 35 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 197 place count 33 transition count 39
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 207 place count 33 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 209 place count 31 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 211 place count 29 transition count 27
Applied a total of 211 rules in 22 ms. Remains 29 /175 variables (removed 146) and now considering 27/210 (removed 183) transitions.
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 29 cols
[2023-03-19 17:01:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-19 17:01:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-19 17:01:19] [INFO ] Invariant cache hit.
[2023-03-19 17:01:19] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2023-03-19 17:01:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 17:01:19] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2023-03-19 17:01:19] [INFO ] Invariant cache hit.
[2023-03-19 17:01:19] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 29/175 places, 27/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 202 ms. Remains : 29/175 places, 27/210 transitions.
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Input system was already deterministic with 27 transitions.
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 3 ms
[2023-03-19 17:01:19] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14704844653674637616.gal : 1 ms
[2023-03-19 17:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15258891908330123698.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14704844653674637616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15258891908330123698.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2880,0.014988,3512,2,153,5,782,6,0,141,651,0
Converting to forward existential form...Done !
original formula: EF(AG(AF(EG(AG(((p185==1)&&(p238==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EG(!(EG(!(E(TRUE U !(((p185==1)&&(p238==1)))))))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.038748,4092,1,0,8,3118,23,4,724,1713,12
FORMULA SmartHome-PT-08-CTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 133 edges and 175 vertex of which 22 / 175 are part of one of the 2 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 154 transition count 136
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 107 transition count 129
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 110 place count 103 transition count 125
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 101 transition count 123
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 117 place count 99 transition count 122
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 117 place count 99 transition count 112
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 137 place count 89 transition count 112
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 150 place count 76 transition count 99
Iterating global reduction 5 with 13 rules applied. Total rules applied 163 place count 76 transition count 99
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 6 rules applied. Total rules applied 169 place count 76 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 75 transition count 93
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 74 transition count 92
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 74 transition count 92
Performed 18 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 208 place count 56 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 212 place count 56 transition count 69
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 214 place count 55 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 218 place count 53 transition count 66
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 222 place count 53 transition count 62
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 224 place count 53 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 226 place count 51 transition count 60
Applied a total of 226 rules in 37 ms. Remains 51 /175 variables (removed 124) and now considering 60/210 (removed 150) transitions.
[2023-03-19 17:01:20] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
// Phase 1: matrix 59 rows 51 cols
[2023-03-19 17:01:20] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-19 17:01:20] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-19 17:01:20] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2023-03-19 17:01:20] [INFO ] Invariant cache hit.
[2023-03-19 17:01:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-19 17:01:20] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-19 17:01:20] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-19 17:01:20] [INFO ] Flow matrix only has 59 transitions (discarded 1 similar events)
[2023-03-19 17:01:20] [INFO ] Invariant cache hit.
[2023-03-19 17:01:20] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/175 places, 60/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 293 ms. Remains : 51/175 places, 60/210 transitions.
[2023-03-19 17:01:20] [INFO ] Flatten gal took : 16 ms
[2023-03-19 17:01:20] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:20] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-19 17:01:20] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:20] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8368167454157413152.gal : 1 ms
[2023-03-19 17:01:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16199305994575957583.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8368167454157413152.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16199305994575957583.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,993602,0.038467,4068,2,425,5,3049,6,0,263,2227,0
Converting to forward existential form...Done !
original formula: EG(EF((E((((p2==1)&&(p138==1))&&((p79==1)&&(p85==1))) U EF((p127==1))) * (((p35==0) + AG(((p217==1)&&(p222==1)))) + (AG(((p185==1)&&(p238...205
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (E((((p2==1)&&(p138==1))&&((p79==1)&&(p85==1))) U E(TRUE U (p127==1))) * (((p35==0) + !(E(TR...284
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t52, Intersection with reachable at each step enabled. (destroyed/reverse/intersect...173
(forward)formula 0,1,0.844119,25876,1,0,264,109253,159,163,1734,156699,276
FORMULA SmartHome-PT-08-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 150 transition count 185
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 150 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 150 transition count 182
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 140 transition count 172
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 140 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 140 transition count 171
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 133 transition count 164
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 133 transition count 164
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 132 transition count 163
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 132 transition count 163
Applied a total of 90 rules in 8 ms. Remains 132 /175 variables (removed 43) and now considering 163/210 (removed 47) transitions.
// Phase 1: matrix 163 rows 132 cols
[2023-03-19 17:01:21] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-19 17:01:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 17:01:21] [INFO ] Invariant cache hit.
[2023-03-19 17:01:21] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-19 17:01:21] [INFO ] Invariant cache hit.
[2023-03-19 17:01:21] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 132/175 places, 163/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 132/175 places, 163/210 transitions.
[2023-03-19 17:01:21] [INFO ] Flatten gal took : 6 ms
[2023-03-19 17:01:21] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:01:21] [INFO ] Input system was already deterministic with 163 transitions.
[2023-03-19 17:01:21] [INFO ] Flatten gal took : 6 ms
[2023-03-19 17:01:21] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12286518101267067435.gal : 1 ms
[2023-03-19 17:01:21] [INFO ] Time to serialize properties into /tmp/CTLFireability11950731964759193646.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12286518101267067435.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11950731964759193646.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.87687e+09,0.288466,13256,2,2657,5,46629,6,0,693,41485,0
Converting to forward existential form...Done !
original formula: A(((p38==1)||(p243==1)) U EF(EX(((p138==1)&&(p247==1)))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EX(((p138==1)&&(p247==1)))))))) * !(E(!(E(TRUE U EX(((p138==1)&&(p247==1))))) U (!(((p...230
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t84, t104, t138, Intersection with reachable at each step enabled. (...202
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,7.79239,227940,1,0,503,1.40118e+06,357,349,4338,1.34085e+06,624
FORMULA SmartHome-PT-08-CTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 152 transition count 187
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 152 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 48 place count 152 transition count 185
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 142 transition count 175
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 142 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 142 transition count 174
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 76 place count 135 transition count 167
Iterating global reduction 2 with 7 rules applied. Total rules applied 83 place count 135 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 134 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 134 transition count 166
Applied a total of 85 rules in 8 ms. Remains 134 /175 variables (removed 41) and now considering 166/210 (removed 44) transitions.
// Phase 1: matrix 166 rows 134 cols
[2023-03-19 17:01:29] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-19 17:01:29] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 17:01:29] [INFO ] Invariant cache hit.
[2023-03-19 17:01:29] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-19 17:01:29] [INFO ] Invariant cache hit.
[2023-03-19 17:01:29] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/175 places, 166/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 323 ms. Remains : 134/175 places, 166/210 transitions.
[2023-03-19 17:01:29] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:29] [INFO ] Flatten gal took : 15 ms
[2023-03-19 17:01:29] [INFO ] Input system was already deterministic with 166 transitions.
[2023-03-19 17:01:29] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:01:29] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:01:29] [INFO ] Time to serialize gal into /tmp/CTLFireability5653678142175568744.gal : 2 ms
[2023-03-19 17:01:29] [INFO ] Time to serialize properties into /tmp/CTLFireability2338788327770914945.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5653678142175568744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2338788327770914945.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.6021e+09,0.454496,14600,2,2715,5,52023,6,0,704,47384,0
Converting to forward existential form...Done !
original formula: E(!((AG(AX((p39==1))) + (p30!=1))) U AG(!(((EX((p198==1)) * AF((p12==1))) * (((p101==1)&&(p26==1)) + AX((p209==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,!((!(E(TRUE U !(!(EX(!((p39==1))))))) + (p30!=1)))) * !(E(TRUE U !(!(((EX((p198==1)) * !(EG(!((p12==...225
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t84, t104, t139, t140, Intersection with reachable at each step enab...208
(forward)formula 0,0,9.79132,266512,1,0,631,1.68638e+06,371,367,4219,1.46995e+06,816
FORMULA SmartHome-PT-08-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 151 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 151 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 151 transition count 183
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 59 place count 143 transition count 175
Iterating global reduction 1 with 8 rules applied. Total rules applied 67 place count 143 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 143 transition count 174
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 137 transition count 168
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 137 transition count 168
Applied a total of 80 rules in 6 ms. Remains 137 /175 variables (removed 38) and now considering 168/210 (removed 42) transitions.
// Phase 1: matrix 168 rows 137 cols
[2023-03-19 17:01:39] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 17:01:39] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-19 17:01:39] [INFO ] Invariant cache hit.
[2023-03-19 17:01:39] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-19 17:01:39] [INFO ] Invariant cache hit.
[2023-03-19 17:01:39] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/175 places, 168/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 137/175 places, 168/210 transitions.
[2023-03-19 17:01:39] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:39] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:39] [INFO ] Input system was already deterministic with 168 transitions.
[2023-03-19 17:01:39] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:40] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:40] [INFO ] Time to serialize gal into /tmp/CTLFireability12933176574503502558.gal : 2 ms
[2023-03-19 17:01:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1695791495846536317.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12933176574503502558.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1695791495846536317.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.18944e+09,0.580994,15660,2,3492,5,56980,6,0,718,49627,0
Converting to forward existential form...Done !
original formula: AG(EF(!(E((p128==1) U (AX(((p2==1)&&(p185==1))) + AG((p162==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E((p128==1) U (!(EX(!(((p2==1)&&(p185==1))))) + !(E(TRUE U !((p162==1))))))))))...164
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t34, t69, t89, t109, t143, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,2.56785,67208,1,0,219,303761,364,150,4156,239724,366
FORMULA SmartHome-PT-08-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Graph (trivial) has 144 edges and 175 vertex of which 38 / 175 are part of one of the 4 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 141 transition count 120
Reduce places removed 47 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 94 transition count 113
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 91 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 109 place count 89 transition count 111
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 109 place count 89 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 127 place count 80 transition count 102
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 139 place count 68 transition count 90
Iterating global reduction 4 with 12 rules applied. Total rules applied 151 place count 68 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 156 place count 68 transition count 85
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 66 transition count 83
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 66 transition count 83
Performed 20 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 200 place count 46 transition count 62
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 8 rules applied. Total rules applied 208 place count 46 transition count 54
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 212 place count 44 transition count 52
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 218 place count 41 transition count 49
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 223 place count 41 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 224 place count 40 transition count 44
Applied a total of 224 rules in 20 ms. Remains 40 /175 variables (removed 135) and now considering 44/210 (removed 166) transitions.
[2023-03-19 17:01:42] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
// Phase 1: matrix 39 rows 40 cols
[2023-03-19 17:01:42] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-19 17:01:42] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 17:01:42] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2023-03-19 17:01:42] [INFO ] Invariant cache hit.
[2023-03-19 17:01:42] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-19 17:01:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 17:01:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 17:01:42] [INFO ] Flow matrix only has 39 transitions (discarded 5 similar events)
[2023-03-19 17:01:42] [INFO ] Invariant cache hit.
[2023-03-19 17:01:42] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_CTL mode, iteration 1 : 40/175 places, 44/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 177 ms. Remains : 40/175 places, 44/210 transitions.
[2023-03-19 17:01:42] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:42] [INFO ] Flatten gal took : 2 ms
[2023-03-19 17:01:42] [INFO ] Input system was already deterministic with 44 transitions.
[2023-03-19 17:01:42] [INFO ] Flatten gal took : 1 ms
[2023-03-19 17:01:42] [INFO ] Flatten gal took : 1 ms
[2023-03-19 17:01:42] [INFO ] Time to serialize gal into /tmp/CTLFireability3761161743509299313.gal : 0 ms
[2023-03-19 17:01:42] [INFO ] Time to serialize properties into /tmp/CTLFireability1466018728399609426.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3761161743509299313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1466018728399609426.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,28730,0.012539,3628,2,234,5,1263,6,0,202,1008,0
Converting to forward existential form...Done !
original formula: A(A((p0==1) U (p102==1)) U !(A(EG((((p69==1)&&(p2==1))&&((p138==1)&&(p217==1)))) U (AG(EF((p17==1))) + AG(((((p21==1)&&(p52==1))&&((p83==...213
=> equivalent forward existential formula: [((Init * !(EG(!(!(!((E(!((!(E(TRUE U !(E(TRUE U (p17==1))))) + !(E(TRUE U !(((((p21==1)&&(p52==1))&&((p83==1)&&...1682
Reverse transition relation is NOT exact ! Due to transitions t27, t30, t35, Intersection with reachable at each step enabled. (destroyed/reverse/intersec...174
(forward)formula 0,1,0.098487,6320,1,0,99,10897,126,59,1275,12199,162
FORMULA SmartHome-PT-08-CTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 151 transition count 186
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 151 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 51 place count 151 transition count 183
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 142 transition count 174
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 142 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 142 transition count 173
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 138 transition count 169
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 138 transition count 169
Applied a total of 78 rules in 12 ms. Remains 138 /175 variables (removed 37) and now considering 169/210 (removed 41) transitions.
// Phase 1: matrix 169 rows 138 cols
[2023-03-19 17:01:42] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-19 17:01:42] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-19 17:01:43] [INFO ] Invariant cache hit.
[2023-03-19 17:01:43] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-19 17:01:43] [INFO ] Invariant cache hit.
[2023-03-19 17:01:43] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/175 places, 169/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 138/175 places, 169/210 transitions.
[2023-03-19 17:01:43] [INFO ] Flatten gal took : 7 ms
[2023-03-19 17:01:43] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:43] [INFO ] Input system was already deterministic with 169 transitions.
[2023-03-19 17:01:43] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:43] [INFO ] Flatten gal took : 8 ms
[2023-03-19 17:01:43] [INFO ] Time to serialize gal into /tmp/CTLFireability17192580328320883087.gal : 2 ms
[2023-03-19 17:01:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5168053449973338840.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17192580328320883087.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5168053449973338840.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.42754e+09,0.458273,12500,2,2910,5,43710,6,0,723,37240,0
Converting to forward existential form...Done !
original formula: EX((AF(((p49==1)&&(p131==1))) * EF((((p217==0)||((p188==0)&&(p117==0)))||(p229==0)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(EG(!(((p49==1)&&(p131==1)))))),TRUE) * (((p217==0)||((p188==0)&&(p117==0)))||(p229==0)))] !...162
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t35, t67, t89, t110, t144, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,8.2984,238820,1,0,594,1.47472e+06,362,341,4086,1.35935e+06,763
FORMULA SmartHome-PT-08-CTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 175/175 places, 210/210 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 155 transition count 190
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 155 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 155 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 149 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 149 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 149 transition count 180
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 145 transition count 176
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 145 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 144 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 144 transition count 175
Applied a total of 66 rules in 6 ms. Remains 144 /175 variables (removed 31) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 144 cols
[2023-03-19 17:01:51] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-19 17:01:51] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-19 17:01:51] [INFO ] Invariant cache hit.
[2023-03-19 17:01:52] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-19 17:01:52] [INFO ] Invariant cache hit.
[2023-03-19 17:01:52] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/175 places, 175/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 290 ms. Remains : 144/175 places, 175/210 transitions.
[2023-03-19 17:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:52] [INFO ] Input system was already deterministic with 175 transitions.
[2023-03-19 17:01:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:52] [INFO ] Flatten gal took : 4 ms
[2023-03-19 17:01:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13896242011585291476.gal : 1 ms
[2023-03-19 17:01:52] [INFO ] Time to serialize properties into /tmp/CTLFireability15088614804665122233.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13896242011585291476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15088614804665122233.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.36962e+09,0.262138,11484,2,2822,5,37418,6,0,753,32562,0
Converting to forward existential form...Done !
original formula: AG((AF(EX((((p64==1)||(p96==1)) * AX((p64==1))))) + (((p33==1) * EX((p116==0))) * EX(EX(EG((p110==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((p33==1) * EX((p116==0))) * EX(EX(EG((p110==1))))))),!(EX((((p64==1)||(p96==1)) * !...185
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t89, t111, t113, t128, t150, Intersection with reachable at each ste...215
(forward)formula 0,0,2.09836,64608,1,0,268,310804,379,174,4467,272390,421
FORMULA SmartHome-PT-08-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2023-03-19 17:01:54] [INFO ] Flatten gal took : 5 ms
[2023-03-19 17:01:54] [INFO ] Flatten gal took : 5 ms
Total runtime 88173 ms.
BK_STOP 1679245315315
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SmartHome-PT-08"
export BK_EXAMINATION="CTLFireability"
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-5348"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r453-smll-167912645100210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;