About the Execution of ITS-Tools for SmartHome-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 815.203 | 273328.00 | 330391.00 | 754.70 | TFFTFFTFFTFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r378-smll-171683811300370.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is SmartHome-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811300370
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Apr 12 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K May 18 16:43 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-05-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-05-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-05-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-05-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-05-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-05-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717030096374
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-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 00:48:18] [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]
[2024-05-30 00:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:48:18] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-30 00:48:18] [INFO ] Transformed 213 places.
[2024-05-30 00:48:18] [INFO ] Transformed 245 transitions.
[2024-05-30 00:48:18] [INFO ] Found NUPN structural information;
[2024-05-30 00:48:18] [INFO ] Parsed PT model containing 213 places and 245 transitions and 557 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
FORMULA SmartHome-PT-05-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 69 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 227/227 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 160 transition count 191
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 160 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 74 place count 160 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 158 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 158 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 157 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 157 transition count 186
Applied a total of 80 rules in 73 ms. Remains 157 /196 variables (removed 39) and now considering 186/227 (removed 41) transitions.
// Phase 1: matrix 186 rows 157 cols
[2024-05-30 00:48:18] [INFO ] Computed 10 invariants in 27 ms
[2024-05-30 00:48:18] [INFO ] Implicit Places using invariants in 328 ms returned []
[2024-05-30 00:48:19] [INFO ] Invariant cache hit.
[2024-05-30 00:48:19] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 631 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-30 00:48:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-30 00:48:21] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 29 ms to minimize.
[2024-05-30 00:48:21] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 2 ms to minimize.
[2024-05-30 00:48:22] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-30 00:48:22] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:48:22] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 4 ms to minimize.
[2024-05-30 00:48:22] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 3 ms to minimize.
[2024-05-30 00:48:23] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-30 00:48:23] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/343 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 0/343 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 175 constraints, problems are : Problem set: 0 solved, 185 unsolved in 11382 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-30 00:48:32] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 4 ms to minimize.
[2024-05-30 00:48:32] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 3 ms to minimize.
[2024-05-30 00:48:32] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 5 (OVERLAPS) 186/343 variables, 157/178 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/343 variables, 185/363 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-30 00:48:36] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 6 ms to minimize.
[2024-05-30 00:48:36] [INFO ] Deduced a trap composed of 25 places in 139 ms of which 3 ms to minimize.
[2024-05-30 00:48:36] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:48:37] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-30 00:48:39] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 368 constraints, problems are : Problem set: 0 solved, 185 unsolved in 18492 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 16/16 constraints]
After SMT, in 30000ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 30037ms
Starting structural reductions in LTL mode, iteration 1 : 157/196 places, 186/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30776 ms. Remains : 157/196 places, 186/227 transitions.
Support contains 69 out of 157 places after structural reductions.
[2024-05-30 00:48:49] [INFO ] Flatten gal took : 84 ms
[2024-05-30 00:48:49] [INFO ] Flatten gal took : 31 ms
[2024-05-30 00:48:49] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 65 out of 157 places (down from 69) after GAL structural reductions.
RANDOM walk for 40000 steps (294 resets) in 2420 ms. (16 steps per ms) remains 5/52 properties
BEST_FIRST walk for 40004 steps (53 resets) in 388 ms. (102 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (52 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (40 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
[2024-05-30 00:48:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 95/108 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-30 00:48:51] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 49/157 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 186/343 variables, 157/168 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/343 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/343 variables, 0/168 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 168 constraints, problems are : Problem set: 2 solved, 3 unsolved in 358 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 102/108 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-30 00:48:51] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 49/157 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 186/343 variables, 157/169 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/343 variables, 3/172 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/343 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/343 variables, 0/172 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 172 constraints, problems are : Problem set: 2 solved, 3 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 3/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 743ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 6388 steps, including 99 resets, run visited all 1 properties in 40 ms. (steps per millisecond=159 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 125 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-30 00:48:52] [INFO ] Flatten gal took : 22 ms
[2024-05-30 00:48:52] [INFO ] Flatten gal took : 23 ms
[2024-05-30 00:48:52] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 57 out of 157 places (down from 58) after GAL structural reductions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 134 transition count 163
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 134 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 134 transition count 160
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 59 place count 124 transition count 150
Iterating global reduction 1 with 10 rules applied. Total rules applied 69 place count 124 transition count 150
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 124 transition count 149
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 76 place count 118 transition count 143
Iterating global reduction 2 with 6 rules applied. Total rules applied 82 place count 118 transition count 143
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 115 transition count 140
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 115 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 89 place count 114 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 90 place count 114 transition count 139
Applied a total of 90 rules in 61 ms. Remains 114 /157 variables (removed 43) and now considering 139/186 (removed 47) transitions.
// Phase 1: matrix 139 rows 114 cols
[2024-05-30 00:48:52] [INFO ] Computed 10 invariants in 4 ms
[2024-05-30 00:48:52] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-30 00:48:52] [INFO ] Invariant cache hit.
[2024-05-30 00:48:52] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-30 00:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-30 00:48:53] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-30 00:48:54] [INFO ] Deduced a trap composed of 49 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:48:54] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 3 ms to minimize.
[2024-05-30 00:48:54] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/253 variables, 114/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 128 constraints, problems are : Problem set: 0 solved, 138 unsolved in 6653 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/253 variables, 114/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 138/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 266 constraints, problems are : Problem set: 0 solved, 138 unsolved in 4790 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 4/4 constraints]
After SMT, in 11482ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 11485ms
Starting structural reductions in LTL mode, iteration 1 : 114/157 places, 139/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11842 ms. Remains : 114/157 places, 139/186 transitions.
[2024-05-30 00:49:04] [INFO ] Flatten gal took : 16 ms
[2024-05-30 00:49:04] [INFO ] Flatten gal took : 15 ms
[2024-05-30 00:49:04] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-30 00:49:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:49:04] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:49:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3410080897557139307.gal : 4 ms
[2024-05-30 00:49:04] [INFO ] Time to serialize properties into /tmp/CTLFireability8375227521217435247.ctl : 4 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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3410080897557139307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8375227521217435247.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.88086e+08,0.196293,8292,2,1730,5,22135,6,0,597,20128,0
Converting to forward existential form...Done !
original formula: E(AX(EF(((p190==1)||(p16==1)))) U !(EF(EG((p95==1)))))
=> equivalent forward existential formula: [(FwdU(Init,!(EX(!(E(TRUE U ((p190==1)||(p16==1))))))) * !(E(TRUE U EG((p95==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t12, t32, t64, t84, t119, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,21.5674,487840,1,0,557,1.89855e+06,310,376,3525,3.73389e+06,715
FORMULA SmartHome-PT-05-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Graph (trivial) has 149 edges and 157 vertex of which 56 / 157 are part of one of the 5 SCC in 6 ms
Free SCC test removed 51 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 105 transition count 83
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 47 rules applied. Total rules applied 85 place count 68 transition count 73
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 7 rules applied. Total rules applied 92 place count 63 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 94 place count 61 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 94 place count 61 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 102 place count 57 transition count 67
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 114 place count 45 transition count 55
Iterating global reduction 4 with 12 rules applied. Total rules applied 126 place count 45 transition count 55
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 45 transition count 53
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 158 place count 30 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 30 transition count 36
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 6 with 2 rules applied. Total rules applied 161 place count 29 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 169 place count 29 transition count 27
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 171 place count 27 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 173 place count 25 transition count 25
Applied a total of 173 rules in 82 ms. Remains 25 /157 variables (removed 132) and now considering 25/186 (removed 161) transitions.
[2024-05-30 00:49:25] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
// Phase 1: matrix 21 rows 25 cols
[2024-05-30 00:49:26] [INFO ] Computed 8 invariants in 3 ms
[2024-05-30 00:49:26] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 00:49:26] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:49:26] [INFO ] Invariant cache hit.
[2024-05-30 00:49:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-30 00:49:26] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 00:49:26] [INFO ] Flow matrix only has 21 transitions (discarded 4 similar events)
[2024-05-30 00:49:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/45 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/46 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2/25 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 20/45 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/45 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/46 variables, and 45 constraints, problems are : Problem set: 0 solved, 12 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 532ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 533ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/157 places, 25/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 763 ms. Remains : 25/157 places, 25/186 transitions.
[2024-05-30 00:49:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:49:26] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:49:26] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-30 00:49:26] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:49:26] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:49:26] [INFO ] Time to serialize gal into /tmp/CTLFireability5377686489909057020.gal : 2 ms
[2024-05-30 00:49:26] [INFO ] Time to serialize properties into /tmp/CTLFireability1118173898315453609.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5377686489909057020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1118173898315453609.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1944,0.010299,3480,2,100,5,431,6,0,123,328,0
Converting to forward existential form...Done !
original formula: AF((AG((p64==0)) + (p144==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(E(TRUE U !((p64==0)))) + (p144==1))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.048451,4324,1,0,42,5280,22,37,617,6486,42
FORMULA SmartHome-PT-05-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 161
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 161
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 132 transition count 158
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 122 transition count 148
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 122 transition count 148
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 122 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 116 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 116 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 113 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 112 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 112 transition count 137
Applied a total of 94 rules in 23 ms. Remains 112 /157 variables (removed 45) and now considering 137/186 (removed 49) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:49:26] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:49:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 00:49:26] [INFO ] Invariant cache hit.
[2024-05-30 00:49:27] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:49:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 3 ms to minimize.
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 3 ms to minimize.
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 3 ms to minimize.
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-30 00:49:28] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-30 00:49:29] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6530 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5401 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 11973ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 11977ms
Starting structural reductions in LTL mode, iteration 1 : 112/157 places, 137/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12241 ms. Remains : 112/157 places, 137/186 transitions.
[2024-05-30 00:49:39] [INFO ] Flatten gal took : 30 ms
[2024-05-30 00:49:39] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:49:39] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-30 00:49:39] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:49:39] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:49:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10818096371599367289.gal : 5 ms
[2024-05-30 00:49:39] [INFO ] Time to serialize properties into /tmp/CTLFireability3764473074554882015.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10818096371599367289.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3764473074554882015.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.76705e+08,0.226272,7564,2,1490,5,18519,6,0,587,16755,0
Converting to forward existential form...Done !
original formula: AG(AX(AF((p174==0))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!((p174==0)))] = FALSE
Hit Full ! (commute/partial/dont) 135/0/2
(forward)formula 0,0,0.741759,16232,1,0,13,75280,20,3,2724,22022,13
FORMULA SmartHome-PT-05-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Graph (trivial) has 153 edges and 157 vertex of which 67 / 157 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 94 transition count 74
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 72 place count 62 transition count 67
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 59 transition count 67
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 75 place count 59 transition count 64
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 56 transition count 64
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 93 place count 44 transition count 52
Iterating global reduction 3 with 12 rules applied. Total rules applied 105 place count 44 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 44 transition count 50
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 29 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 138 place count 29 transition count 33
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 5 with 2 rules applied. Total rules applied 140 place count 28 transition count 32
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 148 place count 28 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 150 place count 26 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 152 place count 24 transition count 22
Applied a total of 152 rules in 27 ms. Remains 24 /157 variables (removed 133) and now considering 22/186 (removed 164) transitions.
[2024-05-30 00:49:39] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
// Phase 1: matrix 18 rows 24 cols
[2024-05-30 00:49:39] [INFO ] Computed 8 invariants in 1 ms
[2024-05-30 00:49:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 00:49:39] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-30 00:49:39] [INFO ] Invariant cache hit.
[2024-05-30 00:49:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-05-30 00:49:40] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 00:49:40] [INFO ] Flow matrix only has 18 transitions (discarded 4 similar events)
[2024-05-30 00:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 32 constraints, problems are : Problem set: 0 solved, 11 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 2/24 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 17/41 variables, 24/32 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/41 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 43 constraints, problems are : Problem set: 0 solved, 11 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 501ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 502ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/157 places, 22/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 655 ms. Remains : 24/157 places, 22/186 transitions.
[2024-05-30 00:49:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:49:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:49:40] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-30 00:49:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:49:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:49:40] [INFO ] Time to serialize gal into /tmp/CTLFireability7544183039219322176.gal : 1 ms
[2024-05-30 00:49:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15206025979105962391.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7544183039219322176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15206025979105962391.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,896,0.009671,3456,2,103,5,469,6,0,116,365,0
Converting to forward existential form...Done !
original formula: EF(EG(((p201==1)&&(p205==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p201==1)&&(p205==1)))] != FALSE
Hit Full ! (commute/partial/dont) 19/2/3
(forward)formula 0,1,0.019928,3772,1,0,8,1606,19,2,595,812,8
FORMULA SmartHome-PT-05-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 135 transition count 164
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 135 transition count 164
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 135 transition count 162
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 126 transition count 153
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 126 transition count 153
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 120 transition count 147
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 120 transition count 147
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 117 transition count 144
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 117 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 116 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 116 transition count 143
Applied a total of 84 rules in 20 ms. Remains 116 /157 variables (removed 41) and now considering 143/186 (removed 43) transitions.
// Phase 1: matrix 143 rows 116 cols
[2024-05-30 00:49:40] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 00:49:40] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 00:49:40] [INFO ] Invariant cache hit.
[2024-05-30 00:49:40] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-30 00:49:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 76 places in 84 ms of which 2 ms to minimize.
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 4 ms to minimize.
[2024-05-30 00:49:42] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 11 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/259 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/259 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 132 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7405 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/259 variables, 116/132 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 142/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/259 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 274 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6087 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 6/6 constraints]
After SMT, in 13531ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 13535ms
Starting structural reductions in LTL mode, iteration 1 : 116/157 places, 143/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13817 ms. Remains : 116/157 places, 143/186 transitions.
[2024-05-30 00:49:54] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:49:54] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:49:54] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-30 00:49:54] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:49:54] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:49:54] [INFO ] Time to serialize gal into /tmp/CTLFireability16280963889871974725.gal : 5 ms
[2024-05-30 00:49:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7086218796361141470.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16280963889871974725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7086218796361141470.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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.05145e+08,0.16096,6536,2,827,5,11934,6,0,609,16132,0
Converting to forward existential form...Done !
original formula: AG(E(AX(AF((p182==1))) U AF((((p114!=1)||(p176!=1))||(p9!=1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!(!(EG(!((p182==1))))))) U !(EG(!((((p114!=1)||(p176!=1))||(p9!=1))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t11, t13, t32, t67, t87, t121, t122, Intersection with reachable at each step en...211
(forward)formula 0,0,2.09187,53800,1,0,547,228176,318,308,3386,386746,699
FORMULA SmartHome-PT-05-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 134 transition count 163
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 134 transition count 163
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 134 transition count 161
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 125 transition count 152
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 125 transition count 152
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 125 transition count 151
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 73 place count 119 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 79 place count 119 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 118 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 118 transition count 144
Applied a total of 81 rules in 13 ms. Remains 118 /157 variables (removed 39) and now considering 144/186 (removed 42) transitions.
// Phase 1: matrix 144 rows 118 cols
[2024-05-30 00:49:56] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:49:56] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 00:49:56] [INFO ] Invariant cache hit.
[2024-05-30 00:49:56] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:49:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 3 ms to minimize.
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 4 ms to minimize.
[2024-05-30 00:49:58] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:49:59] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:49:59] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:50:00] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 144/262 variables, 118/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 137 constraints, problems are : Problem set: 0 solved, 143 unsolved in 8493 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/262 variables, 118/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 143/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 280 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6328 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 9/9 constraints]
After SMT, in 14857ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 14859ms
Starting structural reductions in LTL mode, iteration 1 : 118/157 places, 144/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15123 ms. Remains : 118/157 places, 144/186 transitions.
[2024-05-30 00:50:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:50:11] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:50:11] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-30 00:50:11] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:50:11] [INFO ] Flatten gal took : 13 ms
[2024-05-30 00:50:11] [INFO ] Time to serialize gal into /tmp/CTLFireability7557662354341619479.gal : 3 ms
[2024-05-30 00:50:11] [INFO ] Time to serialize properties into /tmp/CTLFireability15455839050413587230.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7557662354341619479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15455839050413587230.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.03493e+08,0.20881,8124,2,1692,5,20549,6,0,618,19868,0
Converting to forward existential form...Done !
original formula: A(AG(((p128==1)||(p150==1))) U !(EX(AX(EF((p94==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(EX(!(E(TRUE U (p94==1))))))))))) * !(E(!(!(EX(!(EX(!(E(TRUE U (p94==1)))))))) U (!(!(E(T...244
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t9, t11, t33, t34, t69, t89, t123, Intersection with reachable at each step enabled....204
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.44748,62260,1,0,301,362615,319,198,3854,285656,434
FORMULA SmartHome-PT-05-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 161
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 161
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 132 transition count 158
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 62 place count 123 transition count 149
Iterating global reduction 1 with 9 rules applied. Total rules applied 71 place count 123 transition count 149
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 117 transition count 143
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 117 transition count 143
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 114 transition count 140
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 114 transition count 140
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 90 place count 113 transition count 139
Iterating global reduction 1 with 1 rules applied. Total rules applied 91 place count 113 transition count 139
Applied a total of 91 rules in 8 ms. Remains 113 /157 variables (removed 44) and now considering 139/186 (removed 47) transitions.
// Phase 1: matrix 139 rows 113 cols
[2024-05-30 00:50:14] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:50:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 00:50:14] [INFO ] Invariant cache hit.
[2024-05-30 00:50:14] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-05-30 00:50:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-30 00:50:15] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-30 00:50:15] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 2 ms to minimize.
[2024-05-30 00:50:15] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-05-30 00:50:16] [INFO ] Deduced a trap composed of 16 places in 130 ms of which 2 ms to minimize.
[2024-05-30 00:50:16] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (OVERLAPS) 139/252 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 128 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7043 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/252 variables, 113/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 138/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 266 constraints, problems are : Problem set: 0 solved, 138 unsolved in 5636 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 5/5 constraints]
After SMT, in 12698ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 12700ms
Starting structural reductions in LTL mode, iteration 1 : 113/157 places, 139/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12876 ms. Remains : 113/157 places, 139/186 transitions.
[2024-05-30 00:50:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:50:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:50:27] [INFO ] Input system was already deterministic with 139 transitions.
[2024-05-30 00:50:27] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:50:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:50:27] [INFO ] Time to serialize gal into /tmp/CTLFireability16915915092218414656.gal : 1 ms
[2024-05-30 00:50:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11186724580561361684.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16915915092218414656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11186724580561361684.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.83774e+08,0.130728,7572,2,1414,5,17919,6,0,593,16554,0
Converting to forward existential form...Done !
original formula: EF(AX(((A(((p209==1)&&(p212==1)) U (p178==1)) + E(((p2==1)&&(p183==1)) U (p118==1))) + EG((p73==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((!((E(!((p178==1)) U (!(((p209==1)&&(p212==1))) * !((p178==1)))) + EG(!((p178==1))))...225
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t65, t85, t119, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,1,4.49057,128640,1,0,564,811971,315,326,3355,754790,736
FORMULA SmartHome-PT-05-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 161
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 161
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 132 transition count 158
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 122 transition count 148
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 122 transition count 148
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 122 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 116 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 116 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 113 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 112 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 112 transition count 137
Applied a total of 94 rules in 8 ms. Remains 112 /157 variables (removed 45) and now considering 137/186 (removed 49) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:50:31] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:50:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 00:50:31] [INFO ] Invariant cache hit.
[2024-05-30 00:50:31] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 3 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 2 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 1 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 2 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-30 00:50:33] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6407 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5659 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 12095ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12096ms
Starting structural reductions in LTL mode, iteration 1 : 112/157 places, 137/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12327 ms. Remains : 112/157 places, 137/186 transitions.
[2024-05-30 00:50:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:50:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:50:44] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-30 00:50:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:50:44] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:50:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6379071245054574709.gal : 2 ms
[2024-05-30 00:50:44] [INFO ] Time to serialize properties into /tmp/CTLFireability12567482107699441385.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6379071245054574709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12567482107699441385.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.76705e+08,0.15602,7572,2,1490,5,18519,6,0,587,16755,0
Converting to forward existential form...Done !
original formula: AG(EX(TRUE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t63, t83, t117, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,0,1.12015,24072,1,0,168,91362,289,116,3209,85220,280
FORMULA SmartHome-PT-05-CTLFireability-2024-07 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 : 157/157 places, 186/186 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 136 transition count 165
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 136 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 136 transition count 162
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 127 transition count 153
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 127 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 127 transition count 152
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 123 transition count 148
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 123 transition count 148
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 120 transition count 145
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 120 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 119 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 119 transition count 144
Applied a total of 80 rules in 14 ms. Remains 119 /157 variables (removed 38) and now considering 144/186 (removed 42) transitions.
// Phase 1: matrix 144 rows 119 cols
[2024-05-30 00:50:45] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:50:45] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 00:50:45] [INFO ] Invariant cache hit.
[2024-05-30 00:50:45] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:50:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 3 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 2 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 2 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 79 places in 97 ms of which 2 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 3 ms to minimize.
[2024-05-30 00:50:47] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/263 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 137 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6467 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/119 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/263 variables, 119/137 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 143/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 280 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6180 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 119/119 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 8/8 constraints]
After SMT, in 12671ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 12675ms
Starting structural reductions in LTL mode, iteration 1 : 119/157 places, 144/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12942 ms. Remains : 119/157 places, 144/186 transitions.
[2024-05-30 00:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:50:58] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-30 00:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:50:58] [INFO ] Time to serialize gal into /tmp/CTLFireability3222300212716406637.gal : 3 ms
[2024-05-30 00:50:58] [INFO ] Time to serialize properties into /tmp/CTLFireability16522588828803003321.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3222300212716406637.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16522588828803003321.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.54657e+08,0.241531,7864,2,1593,5,20012,6,0,622,17586,0
Converting to forward existential form...Done !
original formula: EG((EF((p82==1)) + (AF(AX((p62==1))) * (AF(((p201==1)&&(p205==1))) + (((p178==0)&&(p58==1))&&((p123==0)||(p46==0)))))))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p82==1)) + (!(EG(!(!(EX(!((p62==1))))))) * (!(EG(!(((p201==1)&&(p205==1))))) + (((p178==0)...204
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t64, t88, t124, Intersection with reachable at each step enabled. (destroy...195
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,17.499,415416,1,0,872,1.96429e+06,330,549,3862,3.02892e+06,940
FORMULA SmartHome-PT-05-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in SI_CTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Graph (trivial) has 128 edges and 157 vertex of which 42 / 157 are part of one of the 4 SCC in 2 ms
Free SCC test removed 38 places
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 118 transition count 104
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 70 place count 86 transition count 99
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 84 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 82 transition count 97
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 76 place count 82 transition count 89
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 92 place count 74 transition count 89
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 100 place count 66 transition count 81
Iterating global reduction 4 with 8 rules applied. Total rules applied 108 place count 66 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 110 place count 66 transition count 79
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 136 place count 53 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 53 transition count 65
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 6 with 2 rules applied. Total rules applied 139 place count 52 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 146 place count 52 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 147 place count 52 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 148 place count 51 transition count 56
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 148 place count 51 transition count 55
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 150 place count 50 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 152 place count 48 transition count 53
Applied a total of 152 rules in 45 ms. Remains 48 /157 variables (removed 109) and now considering 53/186 (removed 133) transitions.
[2024-05-30 00:51:15] [INFO ] Flow matrix only has 50 transitions (discarded 3 similar events)
// Phase 1: matrix 50 rows 48 cols
[2024-05-30 00:51:15] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:51:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 00:51:15] [INFO ] Flow matrix only has 50 transitions (discarded 3 similar events)
[2024-05-30 00:51:15] [INFO ] Invariant cache hit.
[2024-05-30 00:51:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-30 00:51:16] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2024-05-30 00:51:16] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-30 00:51:16] [INFO ] Flow matrix only has 50 transitions (discarded 3 similar events)
[2024-05-30 00:51:16] [INFO ] Invariant cache hit.
[2024-05-30 00:51:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 49/97 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 60 constraints, problems are : Problem set: 0 solved, 43 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 5/48 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 49/97 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 43/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 103 constraints, problems are : Problem set: 0 solved, 43 unsolved in 988 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints]
After SMT, in 1886ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1887ms
Starting structural reductions in SI_CTL mode, iteration 1 : 48/157 places, 53/186 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2095 ms. Remains : 48/157 places, 53/186 transitions.
[2024-05-30 00:51:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:51:17] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:51:17] [INFO ] Input system was already deterministic with 53 transitions.
[2024-05-30 00:51:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:51:18] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:51:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16026635077134887802.gal : 1 ms
[2024-05-30 00:51:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7268371728392452173.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16026635077134887802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7268371728392452173.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,314624,0.027441,3660,2,318,5,1920,6,0,243,1489,0
Converting to forward existential form...Done !
original formula: (!(E((AF((((p151==1)||(p190==1))&&(p52==1))) + !(A((p39!=1) U EG((p3==1))))) U !(((AG((p140==1)) * ((p15!=1) + AG((p131==1)))) + EF((p87=...212
=> equivalent forward existential formula: ([(FwdU((FwdU((Init * !(!((E(!((p55==1)) U (!(!((E(!(!(EG((p172!=1)))) U (!((p196==1)) * !(!(EG((p172!=1)))))) +...788
Reverse transition relation is NOT exact ! Due to transitions t21, t23, t26, t41, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.21041,63272,1,0,1050,355930,169,697,1586,446346,1210
FORMULA SmartHome-PT-05-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 133 transition count 162
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 133 transition count 162
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 133 transition count 159
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 123 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 123 transition count 149
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 123 transition count 148
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 117 transition count 142
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 117 transition count 142
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 114 transition count 139
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 114 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 113 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 113 transition count 138
Applied a total of 92 rules in 12 ms. Remains 113 /157 variables (removed 44) and now considering 138/186 (removed 48) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-30 00:51:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:51:20] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 00:51:20] [INFO ] Invariant cache hit.
[2024-05-30 00:51:20] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-30 00:51:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 3 ms to minimize.
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 3 ms to minimize.
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 2 ms to minimize.
[2024-05-30 00:51:22] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:51:23] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/251 variables, 113/130 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 130 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7766 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/130 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 137/267 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (OVERLAPS) 0/251 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 267 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6125 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 7/7 constraints]
After SMT, in 13916ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 13918ms
Starting structural reductions in LTL mode, iteration 1 : 113/157 places, 138/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14175 ms. Remains : 113/157 places, 138/186 transitions.
[2024-05-30 00:51:34] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:51:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:51:34] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-30 00:51:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:51:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:51:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6350879489578928957.gal : 2 ms
[2024-05-30 00:51:34] [INFO ] Time to serialize properties into /tmp/CTLFireability10486651628340545306.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6350879489578928957.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10486651628340545306.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.64118e+08,0.234057,7840,2,1558,5,19293,6,0,592,18537,0
Converting to forward existential form...Done !
original formula: EG((AG((p95!=1)) + AF((AX((p191==1)) * (p121==0)))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((p95!=1)))) + !(EG(!((!(EX(!((p191==1)))) * (p121==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t10, t12, t32, t64, t84, t118, Intersection with reachable at each step enabled. (de...200
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.72749,38444,1,0,211,195209,313,146,3687,153680,342
FORMULA SmartHome-PT-05-CTLFireability-2024-11 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 : 157/157 places, 186/186 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 136 transition count 165
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 136 transition count 165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 136 transition count 162
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 52 place count 129 transition count 155
Iterating global reduction 1 with 7 rules applied. Total rules applied 59 place count 129 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 129 transition count 154
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 63 place count 126 transition count 151
Iterating global reduction 2 with 3 rules applied. Total rules applied 66 place count 126 transition count 151
Applied a total of 66 rules in 7 ms. Remains 126 /157 variables (removed 31) and now considering 151/186 (removed 35) transitions.
// Phase 1: matrix 151 rows 126 cols
[2024-05-30 00:51:36] [INFO ] Computed 10 invariants in 4 ms
[2024-05-30 00:51:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-30 00:51:36] [INFO ] Invariant cache hit.
[2024-05-30 00:51:36] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-30 00:51:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:51:38] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-30 00:51:38] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 3 ms to minimize.
[2024-05-30 00:51:38] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
[2024-05-30 00:51:38] [INFO ] Deduced a trap composed of 80 places in 107 ms of which 2 ms to minimize.
[2024-05-30 00:51:38] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/277 variables, 126/141 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 141 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7065 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/277 variables, 126/141 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 150/291 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:51:46] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 3 ms to minimize.
[2024-05-30 00:51:46] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:51:49] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/277 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/277 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 294 constraints, problems are : Problem set: 0 solved, 150 unsolved in 12209 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 8/8 constraints]
After SMT, in 19302ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 19305ms
Starting structural reductions in LTL mode, iteration 1 : 126/157 places, 151/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19581 ms. Remains : 126/157 places, 151/186 transitions.
[2024-05-30 00:51:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:51:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:51:55] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-30 00:51:55] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:51:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:51:55] [INFO ] Time to serialize gal into /tmp/CTLFireability1687878524402422284.gal : 2 ms
[2024-05-30 00:51:55] [INFO ] Time to serialize properties into /tmp/CTLFireability1433042056187433878.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability1687878524402422284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1433042056187433878.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,2.46703e+08,0.341266,10008,2,2608,5,30647,6,0,657,25704,0
Converting to forward existential form...Done !
original formula: (E(EG(!(((p167==1)||(p105==1)))) U ((((p156==1) + ((EX((p146==1)) * !(((p14==1)&&(p67==1)))) * (p129==1))) * (p2==1)) * (p73==1))) + AG((...165
=> equivalent forward existential formula: [(FwdU((Init * !(E(EG(!(((p167==1)||(p105==1)))) U ((((p156==1) + ((EX((p146==1)) * !(((p14==1)&&(p67==1)))) * (...222
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t12, t37, t40, t77, t97, t131, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,1,8.67773,196144,1,0,623,1.24151e+06,337,355,3651,1.15893e+06,763
FORMULA SmartHome-PT-05-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 133 transition count 162
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 133 transition count 162
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 133 transition count 159
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 123 transition count 149
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 123 transition count 149
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 123 transition count 148
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 117 transition count 142
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 117 transition count 142
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 114 transition count 139
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 114 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 91 place count 113 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 92 place count 113 transition count 138
Applied a total of 92 rules in 6 ms. Remains 113 /157 variables (removed 44) and now considering 138/186 (removed 48) transitions.
// Phase 1: matrix 138 rows 113 cols
[2024-05-30 00:52:04] [INFO ] Computed 10 invariants in 2 ms
[2024-05-30 00:52:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 00:52:04] [INFO ] Invariant cache hit.
[2024-05-30 00:52:04] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-30 00:52:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:52:06] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 3 ms to minimize.
[2024-05-30 00:52:06] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-30 00:52:06] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:52:06] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:52:06] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 3 ms to minimize.
[2024-05-30 00:52:07] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 3 ms to minimize.
[2024-05-30 00:52:07] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 3 ms to minimize.
[2024-05-30 00:52:07] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
[2024-05-30 00:52:07] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (OVERLAPS) 138/251 variables, 113/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 132 constraints, problems are : Problem set: 0 solved, 137 unsolved in 7128 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 137 unsolved
[2024-05-30 00:52:13] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 138/251 variables, 113/133 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 137/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 8 (OVERLAPS) 0/251 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 270 constraints, problems are : Problem set: 0 solved, 137 unsolved in 6927 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 113/113 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 10/10 constraints]
After SMT, in 14082ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 14085ms
Starting structural reductions in LTL mode, iteration 1 : 113/157 places, 138/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14348 ms. Remains : 113/157 places, 138/186 transitions.
[2024-05-30 00:52:18] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:52:18] [INFO ] Input system was already deterministic with 138 transitions.
[2024-05-30 00:52:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:52:18] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability14998892315947414982.gal : 2 ms
[2024-05-30 00:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9638607474860165257.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14998892315947414982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9638607474860165257.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.85312e+08,0.189936,7576,2,1561,5,18910,6,0,592,17579,0
Converting to forward existential form...Done !
original formula: EX(((A(EF((p32!=1)) U AG(!(((p2==1)&&(p104==1))))) + AF(AX((p37==1)))) + EG(EX((((p2==1)&&(p183==1))||(p13==1))))))
=> equivalent forward existential formula: (([((EY(Init) * !(EG(!(!(E(TRUE U !(!(((p2==1)&&(p104==1)))))))))) * !(E(!(!(E(TRUE U !(!(((p2==1)&&(p104==1))))...364
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t63, t83, t103, t118, Intersection with reachable at each step enabled. (d...201
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.8351,51596,1,0,220,278023,316,150,3688,213304,359
FORMULA SmartHome-PT-05-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 134 transition count 163
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 134 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 134 transition count 160
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 125 transition count 151
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 125 transition count 151
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 125 transition count 150
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 120 transition count 145
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 120 transition count 145
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 118 transition count 143
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 118 transition count 143
Applied a total of 82 rules in 7 ms. Remains 118 /157 variables (removed 39) and now considering 143/186 (removed 43) transitions.
// Phase 1: matrix 143 rows 118 cols
[2024-05-30 00:52:20] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:52:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 00:52:20] [INFO ] Invariant cache hit.
[2024-05-30 00:52:21] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-30 00:52:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
[2024-05-30 00:52:22] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 3 ms to minimize.
[2024-05-30 00:52:22] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-30 00:52:22] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 2 ms to minimize.
[2024-05-30 00:52:23] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-30 00:52:23] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 3 ms to minimize.
[2024-05-30 00:52:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-30 00:52:23] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:52:23] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/261 variables, 118/136 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/261 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 136 constraints, problems are : Problem set: 0 solved, 142 unsolved in 7413 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 143/261 variables, 118/136 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 142/278 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 278 constraints, problems are : Problem set: 0 solved, 142 unsolved in 6230 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 8/8 constraints]
After SMT, in 13675ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 13679ms
Starting structural reductions in LTL mode, iteration 1 : 118/157 places, 143/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13939 ms. Remains : 118/157 places, 143/186 transitions.
[2024-05-30 00:52:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:52:34] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:52:34] [INFO ] Input system was already deterministic with 143 transitions.
[2024-05-30 00:52:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:34] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2492624315195686570.gal : 2 ms
[2024-05-30 00:52:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2616083586852507800.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2492624315195686570.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2616083586852507800.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.90305e+08,0.243406,7856,2,1570,5,19531,6,0,617,18695,0
Converting to forward existential form...Done !
original formula: E((p42==1) U (EX(!(AG((p72==1)))) + !(AF(AG((p152==1))))))
=> equivalent forward existential formula: ([(FwdU(EY(FwdU(Init,(p42==1))),TRUE) * !((p72==1)))] != FALSE + [FwdG(FwdU(Init,(p42==1)),!(!(E(TRUE U !((p152=...174
Hit Full ! (commute/partial/dont) 137/0/6
(forward)formula 0,1,0.391553,8384,1,0,11,22127,17,2,1207,21510,7
FORMULA SmartHome-PT-05-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 186/186 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 132 transition count 161
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 132 transition count 161
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 132 transition count 158
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 63 place count 122 transition count 148
Iterating global reduction 1 with 10 rules applied. Total rules applied 73 place count 122 transition count 148
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 122 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 116 transition count 141
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 116 transition count 141
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 113 transition count 138
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 113 transition count 138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 112 transition count 137
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 112 transition count 137
Applied a total of 94 rules in 13 ms. Remains 112 /157 variables (removed 45) and now considering 137/186 (removed 49) transitions.
// Phase 1: matrix 137 rows 112 cols
[2024-05-30 00:52:35] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 00:52:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 00:52:35] [INFO ] Invariant cache hit.
[2024-05-30 00:52:35] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-05-30 00:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 3 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-30 00:52:37] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 129 constraints, problems are : Problem set: 0 solved, 136 unsolved in 6821 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/112 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (OVERLAPS) 137/249 variables, 112/129 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 136/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 0/249 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 265 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5875 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 112/112 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 7/7 constraints]
After SMT, in 12725ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 12729ms
Starting structural reductions in LTL mode, iteration 1 : 112/157 places, 137/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13019 ms. Remains : 112/157 places, 137/186 transitions.
[2024-05-30 00:52:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:48] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:52:48] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-30 00:52:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:48] [INFO ] Flatten gal took : 6 ms
[2024-05-30 00:52:48] [INFO ] Time to serialize gal into /tmp/CTLFireability2797552902084540253.gal : 1 ms
[2024-05-30 00:52:48] [INFO ] Time to serialize properties into /tmp/CTLFireability13041284579949891595.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.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2797552902084540253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13041284579949891595.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/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,1.76705e+08,0.217189,7568,2,1490,5,18519,6,0,587,16755,0
Converting to forward existential form...Done !
original formula: AX((E(!(EX(!(((p183==1)&&(p193==1))))) U EF(AG((p73==1)))) * EF((p86==0))))
=> equivalent forward existential formula: ([(EY(Init) * !(E(!(EX(!(((p183==1)&&(p193==1))))) U E(TRUE U !(E(TRUE U !((p73==1))))))))] = FALSE * [(EY(Init)...190
Reverse transition relation is NOT exact ! Due to transitions t8, t9, t11, t31, t63, t83, t117, Intersection with reachable at each step enabled. (destroy...195
(forward)formula 0,0,1.29589,28264,1,0,174,118571,302,118,3473,100447,293
FORMULA SmartHome-PT-05-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-30 00:52:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:52:49] [INFO ] Flatten gal took : 5 ms
Total runtime 271541 ms.
BK_STOP 1717030369702
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-05"
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-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-05, 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 r378-smll-171683811300370"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-05.tgz
mv SmartHome-PT-05 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 ;