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-171683811400410.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-10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r378-smll-171683811400410
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K 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 49K 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.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 12 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 12 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 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 68K 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-10-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-10-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-10-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717032244582

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:24:07] [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 01:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:24:07] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2024-05-30 01:24:07] [INFO ] Transformed 273 places.
[2024-05-30 01:24:07] [INFO ] Transformed 308 transitions.
[2024-05-30 01:24:07] [INFO ] Found NUPN structural information;
[2024-05-30 01:24:07] [INFO ] Parsed PT model containing 273 places and 308 transitions and 699 arcs in 427 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Deduced a syphon composed of 40 places in 9 ms
Reduce places removed 40 places and 45 transitions.
FORMULA SmartHome-PT-10-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 263/263 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 196 transition count 226
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 196 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 196 transition count 224
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 192 transition count 220
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 192 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 87 place count 189 transition count 217
Iterating global reduction 1 with 3 rules applied. Total rules applied 90 place count 189 transition count 217
Applied a total of 90 rules in 158 ms. Remains 189 /233 variables (removed 44) and now considering 217/263 (removed 46) transitions.
// Phase 1: matrix 217 rows 189 cols
[2024-05-30 01:24:08] [INFO ] Computed 12 invariants in 37 ms
[2024-05-30 01:24:08] [INFO ] Implicit Places using invariants in 491 ms returned []
[2024-05-30 01:24:08] [INFO ] Invariant cache hit.
[2024-05-30 01:24:08] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 958 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-30 01:24:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 46 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 5 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 4 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-30 01:24:13] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
[2024-05-30 01:24:14] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-05-30 01:24:14] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/406 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/406 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 209 constraints, problems are : Problem set: 0 solved, 216 unsolved in 15758 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/189 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/406 variables, 189/209 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 216/425 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-30 01:24:29] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 3 ms to minimize.
[2024-05-30 01:24:29] [INFO ] Deduced a trap composed of 28 places in 79 ms of which 2 ms to minimize.
[2024-05-30 01:24:30] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-30 01:24:31] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (OVERLAPS) 0/406 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 429 constraints, problems are : Problem set: 0 solved, 216 unsolved in 16547 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 12/12 constraints]
After SMT, in 32485ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 32532ms
Starting structural reductions in LTL mode, iteration 1 : 189/233 places, 217/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33725 ms. Remains : 189/233 places, 217/263 transitions.
Support contains 68 out of 189 places after structural reductions.
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 138 ms
[2024-05-30 01:24:42] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA SmartHome-PT-10-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-10-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 01:24:42] [INFO ] Flatten gal took : 36 ms
[2024-05-30 01:24:42] [INFO ] Input system was already deterministic with 217 transitions.
Support contains 54 out of 189 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (285 resets) in 3333 ms. (11 steps per ms) remains 6/47 properties
BEST_FIRST walk for 40004 steps (50 resets) in 279 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 197 ms. (202 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 74 ms. (533 steps per ms) remains 5/6 properties
[2024-05-30 01:24:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 01:24:43] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
[2024-05-30 01:24:43] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 51/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/189 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 217/406 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/406 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 203 constraints, problems are : Problem set: 0 solved, 5 unsolved in 695 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 51/180 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 9/189 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 217/406 variables, 189/203 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 5/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 01:24:44] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/406 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 209 constraints, problems are : Problem set: 0 solved, 5 unsolved in 754 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1459ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 1321 ms.
Support contains 8 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 217/217 transitions.
Graph (trivial) has 166 edges and 189 vertex of which 58 / 189 are part of one of the 5 SCC in 3 ms
Free SCC test removed 53 places
Drop transitions (Empty/Sink Transition effects.) removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 136 transition count 101
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 57 rules applied. Total rules applied 103 place count 91 transition count 89
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 112 place count 84 transition count 87
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 116 place count 83 transition count 84
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 120 place count 80 transition count 83
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 120 place count 80 transition count 78
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 130 place count 75 transition count 78
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 137 place count 68 transition count 71
Iterating global reduction 5 with 7 rules applied. Total rules applied 144 place count 68 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 145 place count 68 transition count 70
Performed 24 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 193 place count 44 transition count 44
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 139 edges and 44 vertex of which 42 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 8 rules applied. Total rules applied 201 place count 42 transition count 37
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 206 place count 42 transition count 32
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 211 place count 37 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 212 place count 36 transition count 31
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 214 place count 34 transition count 31
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 3 Pre rules applied. Total rules applied 214 place count 34 transition count 28
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 220 place count 31 transition count 28
Applied a total of 220 rules in 58 ms. Remains 31 /189 variables (removed 158) and now considering 28/217 (removed 189) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 31/189 places, 28/217 transitions.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
// Phase 1: matrix 28 rows 31 cols
[2024-05-30 01:24:46] [INFO ] Computed 8 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:24:46] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-30 01:24:46] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/55 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/55 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 55/59 variables, and 38 constraints, problems are : Problem set: 0 solved, 2 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 6/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 29/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/17 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/23 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 6/29 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 26/55 variables, 29/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/57 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/59 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/59 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 43 constraints, problems are : Problem set: 0 solved, 2 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 238ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 54 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 10 ms.
[2024-05-30 01:24:46] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:46] [INFO ] Flatten gal took : 15 ms
[2024-05-30 01:24:46] [INFO ] Input system was already deterministic with 217 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 167 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 167 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 167 transition count 194
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 161 transition count 188
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 161 transition count 188
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 63 place count 155 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 69 place count 155 transition count 182
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 151 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 151 transition count 178
Applied a total of 77 rules in 18 ms. Remains 151 /189 variables (removed 38) and now considering 178/217 (removed 39) transitions.
// Phase 1: matrix 178 rows 151 cols
[2024-05-30 01:24:47] [INFO ] Computed 12 invariants in 5 ms
[2024-05-30 01:24:47] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 01:24:47] [INFO ] Invariant cache hit.
[2024-05-30 01:24:47] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-30 01:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 3 ms to minimize.
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:24:49] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-30 01:24:50] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-30 01:24:50] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 3 ms to minimize.
[2024-05-30 01:24:50] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/329 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 169 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10654 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-30 01:24:59] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/329 variables, 151/170 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 177/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-30 01:25:02] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/329 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/329 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 348 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12179 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 8/8 constraints]
After SMT, in 22902ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 22909ms
Starting structural reductions in LTL mode, iteration 1 : 151/189 places, 178/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23148 ms. Remains : 151/189 places, 178/217 transitions.
[2024-05-30 01:25:10] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:25:10] [INFO ] Flatten gal took : 20 ms
[2024-05-30 01:25:10] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-30 01:25:10] [INFO ] Flatten gal took : 18 ms
[2024-05-30 01:25:10] [INFO ] Flatten gal took : 17 ms
[2024-05-30 01:25:10] [INFO ] Time to serialize gal into /tmp/CTLFireability13373850994436506624.gal : 9 ms
[2024-05-30 01:25:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7093227957323124654.ctl : 5 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/CTLFireability13373850994436506624.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7093227957323124654.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,6.47038e+09,0.715041,18876,2,6679,5,77619,6,0,784,52586,0


Converting to forward existential form...Done !
original formula: AX((E(!(E((p48==1) U (p233==1))) U AG((p135==1))) + ((!(A((p128==1) U (((p57==1)&&(p261==1))||(p201==1)))) * (p209==0)) * (AG((((p57==0)|...208
=> equivalent forward existential formula: (([(((EY(Init) * !(E(!(E((p48==1) U (p233==1))) U !(E(TRUE U !((p135==1))))))) * !(EG(!((((p57==1)&&(p261==1))||...644
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t17, t42, t69, t105, t151, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,0,6.0281,142860,1,0,233,596704,391,161,4884,495551,385
FORMULA SmartHome-PT-10-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Graph (trivial) has 171 edges and 189 vertex of which 82 / 189 are part of one of the 6 SCC in 1 ms
Free SCC test removed 76 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 112 transition count 89
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 35 rules applied. Total rules applied 67 place count 81 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 69 place count 79 transition count 85
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 69 place count 79 transition count 80
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 79 place count 74 transition count 80
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 88 place count 65 transition count 71
Iterating global reduction 3 with 9 rules applied. Total rules applied 97 place count 65 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 100 place count 65 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 101 place count 64 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 101 place count 64 transition count 67
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 103 place count 63 transition count 67
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 5 with 36 rules applied. Total rules applied 139 place count 45 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 140 place count 45 transition count 48
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 142 place count 44 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 148 place count 44 transition count 41
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 150 place count 42 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 152 place count 40 transition count 39
Applied a total of 152 rules in 86 ms. Remains 40 /189 variables (removed 149) and now considering 39/217 (removed 178) transitions.
[2024-05-30 01:25:16] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
// Phase 1: matrix 34 rows 40 cols
[2024-05-30 01:25:16] [INFO ] Computed 10 invariants in 4 ms
[2024-05-30 01:25:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 01:25:16] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-05-30 01:25:16] [INFO ] Invariant cache hit.
[2024-05-30 01:25:16] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-30 01:25:16] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-30 01:25:16] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-30 01:25:16] [INFO ] Flow matrix only has 34 transitions (discarded 5 similar events)
[2024-05-30 01:25:16] [INFO ] Invariant cache hit.
[2024-05-30 01:25:16] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 3/40 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 33/73 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/73 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/74 variables, and 55 constraints, problems are : Problem set: 0 solved, 26 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 3/40 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 33/73 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 26/81 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/74 variables, and 81 constraints, problems are : Problem set: 0 solved, 26 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 925ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 926ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/189 places, 39/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1143 ms. Remains : 40/189 places, 39/217 transitions.
[2024-05-30 01:25:17] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:25:17] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:25:17] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 01:25:17] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:17] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:17] [INFO ] Time to serialize gal into /tmp/CTLFireability1541103500069553410.gal : 2 ms
[2024-05-30 01:25:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7560679555225698715.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/CTLFireability1541103500069553410.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7560679555225698715.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,8192,0.022732,3592,2,459,5,1835,6,0,195,1290,0


Converting to forward existential form...Done !
original formula: AG(AF(E(EF((p108==1)) U EF((p201==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E(E(TRUE U (p108==1)) U E(TRUE U (p201==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0...163
(forward)formula 0,0,0.14478,6548,1,0,69,16193,101,41,1171,10978,99
FORMULA SmartHome-PT-10-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Graph (trivial) has 174 edges and 189 vertex of which 89 / 189 are part of one of the 6 SCC in 1 ms
Free SCC test removed 83 places
Ensure Unique test removed 104 transitions
Reduce isomorphic transitions removed 104 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 106 transition count 84
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 33 rules applied. Total rules applied 63 place count 77 transition count 80
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 75 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 75 transition count 76
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 71 transition count 76
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 81 place count 63 transition count 68
Iterating global reduction 3 with 8 rules applied. Total rules applied 89 place count 63 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 90 place count 63 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 90 place count 63 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 62 transition count 66
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 134 place count 41 transition count 45
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 135 place count 41 transition count 44
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 137 place count 40 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 143 place count 40 transition count 37
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 38 transition count 37
Applied a total of 145 rules in 41 ms. Remains 38 /189 variables (removed 151) and now considering 37/217 (removed 180) transitions.
[2024-05-30 01:25:17] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 38 cols
[2024-05-30 01:25:17] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:25:17] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 01:25:17] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-30 01:25:17] [INFO ] Invariant cache hit.
[2024-05-30 01:25:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-30 01:25:17] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2024-05-30 01:25:18] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-30 01:25:18] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-05-30 01:25:18] [INFO ] Invariant cache hit.
[2024-05-30 01:25:18] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 68 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1213 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 31/69 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 19/67 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 36/103 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 1/70 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (OVERLAPS) 0/70 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 104 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 2392ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2393ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/189 places, 37/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2624 ms. Remains : 38/189 places, 37/217 transitions.
[2024-05-30 01:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:20] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-30 01:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:20] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:25:20] [INFO ] Time to serialize gal into /tmp/CTLFireability11228500256193360752.gal : 2 ms
[2024-05-30 01:25:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16762179384569847812.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/CTLFireability11228500256193360752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16762179384569847812.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,5953,0.029389,3908,2,662,5,2327,6,0,185,1715,0


Converting to forward existential form...Done !
original formula: AF(((p105==1) * EF((p0==1))))
=> equivalent forward existential formula: [FwdG(Init,!(((p105==1) * E(TRUE U (p0==1)))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,0,0.111911,6020,1,0,9,11613,19,6,982,4758,12
FORMULA SmartHome-PT-10-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 168 transition count 196
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 168 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 168 transition count 195
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 161 transition count 188
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 161 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 154 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 154 transition count 181
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 151 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 151 transition count 178
Applied a total of 77 rules in 17 ms. Remains 151 /189 variables (removed 38) and now considering 178/217 (removed 39) transitions.
// Phase 1: matrix 178 rows 151 cols
[2024-05-30 01:25:20] [INFO ] Computed 12 invariants in 3 ms
[2024-05-30 01:25:20] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-05-30 01:25:20] [INFO ] Invariant cache hit.
[2024-05-30 01:25:20] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-30 01:25:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 3 ms to minimize.
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 2 ms to minimize.
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-05-30 01:25:23] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/329 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/329 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 329/329 variables, and 169 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9773 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/151 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/329 variables, 151/169 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 177/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-30 01:25:33] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/329 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/329 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 329/329 variables, and 347 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9642 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 7/7 constraints]
After SMT, in 19461ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 19465ms
Starting structural reductions in LTL mode, iteration 1 : 151/189 places, 178/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19813 ms. Remains : 151/189 places, 178/217 transitions.
[2024-05-30 01:25:40] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:25:40] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:25:40] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-30 01:25:40] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:25:40] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:25:40] [INFO ] Time to serialize gal into /tmp/CTLFireability11391596216902866977.gal : 3 ms
[2024-05-30 01:25:40] [INFO ] Time to serialize properties into /tmp/CTLFireability1922040943245785113.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/CTLFireability11391596216902866977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1922040943245785113.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.05946e+10,0.849319,27116,2,10656,5,113110,6,0,784,81277,0


Converting to forward existential form...Done !
original formula: AG(((EF((EF(EX((p187==1))) + (((p138==1)||((p233==1)&&(p236==1)))&&(p151==1)))) + (p38==1)) + EX(EF((p106==0)))))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !(EX(E(TRUE U (p106==0))))) * !((p38==1))) * !(E(TRUE U (E(TRUE U EX((p187==1))) + (((p138...209
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t18, t66, t105, t151, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,0,9.81514,214224,1,0,243,939252,381,167,4527,738582,397
FORMULA SmartHome-PT-10-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 165 transition count 193
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 165 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 165 transition count 192
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 156 transition count 183
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 156 transition count 183
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 147 transition count 174
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 147 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 143 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 143 transition count 170
Applied a total of 93 rules in 11 ms. Remains 143 /189 variables (removed 46) and now considering 170/217 (removed 47) transitions.
// Phase 1: matrix 170 rows 143 cols
[2024-05-30 01:25:50] [INFO ] Computed 12 invariants in 3 ms
[2024-05-30 01:25:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 01:25:50] [INFO ] Invariant cache hit.
[2024-05-30 01:25:50] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-30 01:25:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 4 ms to minimize.
[2024-05-30 01:25:52] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 5 ms to minimize.
[2024-05-30 01:25:53] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 159 constraints, problems are : Problem set: 0 solved, 169 unsolved in 9504 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 7890 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
After SMT, in 17423ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 17426ms
Starting structural reductions in LTL mode, iteration 1 : 143/189 places, 170/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17668 ms. Remains : 143/189 places, 170/217 transitions.
[2024-05-30 01:26:08] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:26:08] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:26:08] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-30 01:26:08] [INFO ] Flatten gal took : 23 ms
[2024-05-30 01:26:08] [INFO ] Flatten gal took : 27 ms
[2024-05-30 01:26:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11363134271838552938.gal : 3 ms
[2024-05-30 01:26:08] [INFO ] Time to serialize properties into /tmp/CTLFireability5362989401834618806.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/CTLFireability11363134271838552938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5362989401834618806.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,5.20668e+09,0.553483,14372,2,3776,5,53880,6,0,744,41024,0


Converting to forward existential form...Done !
original formula: AX(EF((p38==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p38==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,3.17838,75780,1,0,212,322394,361,147,4317,226278,359
FORMULA SmartHome-PT-10-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Graph (trivial) has 171 edges and 189 vertex of which 86 / 189 are part of one of the 6 SCC in 1 ms
Free SCC test removed 80 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 108 transition count 86
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 34 rules applied. Total rules applied 65 place count 78 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 76 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 67 place count 76 transition count 78
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 72 transition count 78
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 66 transition count 72
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 66 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 66 transition count 71
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 126 place count 47 transition count 52
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 127 place count 47 transition count 51
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 129 place count 46 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 135 place count 46 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 137 place count 44 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 139 place count 42 transition count 42
Applied a total of 139 rules in 38 ms. Remains 42 /189 variables (removed 147) and now considering 42/217 (removed 175) transitions.
[2024-05-30 01:26:11] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 42 cols
[2024-05-30 01:26:11] [INFO ] Computed 10 invariants in 0 ms
[2024-05-30 01:26:11] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:26:11] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-30 01:26:11] [INFO ] Invariant cache hit.
[2024-05-30 01:26:11] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-30 01:26:11] [INFO ] Redundant transitions in 1 ms returned []
Running 27 sub problems to find dead transitions.
[2024-05-30 01:26:11] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
[2024-05-30 01:26:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
[2024-05-30 01:26:11] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 36/78 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/79 variables, and 53 constraints, problems are : Problem set: 0 solved, 27 unsolved in 724 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 36/78 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 27/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/79 variables, and 80 constraints, problems are : Problem set: 0 solved, 27 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 42/42 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 1/1 constraints]
After SMT, in 1422ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 1423ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/189 places, 42/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1614 ms. Remains : 42/189 places, 42/217 transitions.
[2024-05-30 01:26:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:26:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:26:12] [INFO ] Input system was already deterministic with 42 transitions.
[2024-05-30 01:26:12] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:26:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:26:12] [INFO ] Time to serialize gal into /tmp/CTLFireability11062890944102322257.gal : 2 ms
[2024-05-30 01:26:12] [INFO ] Time to serialize properties into /tmp/CTLFireability15812464551104823929.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/CTLFireability11062890944102322257.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15812464551104823929.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,13680,0.056871,4456,2,1097,5,6243,6,0,207,4172,0


Converting to forward existential form...Done !
original formula: EF((((!(A(((p264==1)&&(p270==1)) U (p35==1))) * (p215!=1)) * ((p264==1)&&(p270==1))) * !(A(EG((p215==1)) U (p16!=1)))))
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,TRUE) * ((!(!((E(!((p35==1)) U (!(((p264==1)&&(p270==1))) * !((p35==1)))) + EG(!((p35==1))))...433
Reverse transition relation is NOT exact ! Due to transitions t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
Hit Full ! (commute/partial/dont) 40/0/2
(forward)formula 0,0,0.672335,20896,1,0,173,106395,123,101,1207,83174,232
FORMULA SmartHome-PT-10-CTLFireability-2024-06 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 : 189/189 places, 217/217 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 167 transition count 195
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 167 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 167 transition count 194
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 158 transition count 185
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 158 transition count 185
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 149 transition count 176
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 149 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 83 place count 147 transition count 174
Iterating global reduction 1 with 2 rules applied. Total rules applied 85 place count 147 transition count 174
Applied a total of 85 rules in 10 ms. Remains 147 /189 variables (removed 42) and now considering 174/217 (removed 43) transitions.
// Phase 1: matrix 174 rows 147 cols
[2024-05-30 01:26:13] [INFO ] Computed 12 invariants in 2 ms
[2024-05-30 01:26:13] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 01:26:13] [INFO ] Invariant cache hit.
[2024-05-30 01:26:13] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-30 01:26:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:26:16] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 3 ms to minimize.
[2024-05-30 01:26:16] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:26:16] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 4 ms to minimize.
[2024-05-30 01:26:16] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-05-30 01:26:17] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 2 ms to minimize.
[2024-05-30 01:26:17] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 165 constraints, problems are : Problem set: 0 solved, 173 unsolved in 10305 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 173/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 338 constraints, problems are : Problem set: 0 solved, 173 unsolved in 7556 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 6/6 constraints]
After SMT, in 17895ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 17898ms
Starting structural reductions in LTL mode, iteration 1 : 147/189 places, 174/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18204 ms. Remains : 147/189 places, 174/217 transitions.
[2024-05-30 01:26:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:26:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 01:26:31] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-30 01:26:31] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:26:31] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:26:31] [INFO ] Time to serialize gal into /tmp/CTLFireability14198883956198123658.gal : 3 ms
[2024-05-30 01:26:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10304456792016729353.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/CTLFireability14198883956198123658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10304456792016729353.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,6.39129e+09,0.494247,16496,2,4579,5,62784,6,0,764,51227,0


Converting to forward existential form...Done !
original formula: AG((AF((EX(((p114==1)&&(p184==1))) + EF((p109==0)))) + (p124==1)))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((p124==1))),!((EX(((p114==1)&&(p184==1))) + E(TRUE U (p109==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t64, t85, t101, t147, Intersection with reachable at each step enabled. (dest...198
(forward)formula 0,1,3.52501,87360,1,0,225,385474,378,151,4534,313958,370
FORMULA SmartHome-PT-10-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 198
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 170 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 164 transition count 191
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 164 transition count 191
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 158 transition count 185
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 158 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 155 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 155 transition count 182
Applied a total of 69 rules in 9 ms. Remains 155 /189 variables (removed 34) and now considering 182/217 (removed 35) transitions.
// Phase 1: matrix 182 rows 155 cols
[2024-05-30 01:26:35] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:26:35] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-30 01:26:35] [INFO ] Invariant cache hit.
[2024-05-30 01:26:35] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-30 01:26:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-30 01:26:37] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 3 ms to minimize.
[2024-05-30 01:26:37] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 3 ms to minimize.
[2024-05-30 01:26:37] [INFO ] Deduced a trap composed of 40 places in 129 ms of which 3 ms to minimize.
[2024-05-30 01:26:38] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 3 ms to minimize.
[2024-05-30 01:26:38] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (OVERLAPS) 182/337 variables, 155/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (OVERLAPS) 0/337 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 172 constraints, problems are : Problem set: 0 solved, 181 unsolved in 9230 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/155 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-30 01:26:46] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/337 variables, 155/173 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 181/354 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-30 01:26:49] [INFO ] Deduced a trap composed of 55 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 355 constraints, problems are : Problem set: 0 solved, 181 unsolved in 11012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 7/7 constraints]
After SMT, in 20265ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 20269ms
Starting structural reductions in LTL mode, iteration 1 : 155/189 places, 182/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20492 ms. Remains : 155/189 places, 182/217 transitions.
[2024-05-30 01:26:56] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:26:56] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:26:56] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-30 01:26:56] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:26:56] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:26:56] [INFO ] Time to serialize gal into /tmp/CTLFireability16763374401132595169.gal : 2 ms
[2024-05-30 01:26:56] [INFO ] Time to serialize properties into /tmp/CTLFireability1055878748856618763.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/CTLFireability16763374401132595169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1055878748856618763.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,8.58124e+09,0.721994,19396,2,6208,5,79103,6,0,804,57193,0


Converting to forward existential form...Done !
original formula: AG((EF(EX((p218==1))) * ((((p71==1) + EF((p208==1))) + (EX(((p259==1)&&(p270==1))) + ((p57==1)&&(p204==1)))) + (AG((p182==0)) * EX((p76==...162
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U EX((p218==1)))))] = FALSE * ([(FwdU((FwdU(Init,TRUE) * !((((p71==1) + E(TRUE U (...401
Reverse transition relation is NOT exact ! Due to transitions t13, t14, t19, t70, t106, t155, Intersection with reachable at each step enabled. (destroyed...193
(forward)formula 0,0,5.65982,145300,1,0,239,696594,389,167,4636,511856,394
FORMULA SmartHome-PT-10-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 169 transition count 197
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 169 transition count 197
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 169 transition count 196
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 162 transition count 189
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 162 transition count 189
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 155 transition count 182
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 155 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 72 place count 152 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 75 place count 152 transition count 179
Applied a total of 75 rules in 7 ms. Remains 152 /189 variables (removed 37) and now considering 179/217 (removed 38) transitions.
// Phase 1: matrix 179 rows 152 cols
[2024-05-30 01:27:01] [INFO ] Computed 12 invariants in 3 ms
[2024-05-30 01:27:01] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 01:27:01] [INFO ] Invariant cache hit.
[2024-05-30 01:27:01] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-30 01:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-30 01:27:03] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 3 ms to minimize.
[2024-05-30 01:27:03] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/331 variables, 152/166 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/331 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 166 constraints, problems are : Problem set: 0 solved, 178 unsolved in 9115 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/152 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (OVERLAPS) 179/331 variables, 152/166 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/331 variables, 178/344 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-30 01:27:14] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/331 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/331 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (OVERLAPS) 0/331 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 345 constraints, problems are : Problem set: 0 solved, 178 unsolved in 10841 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 3/3 constraints]
After SMT, in 19983ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 19987ms
Starting structural reductions in LTL mode, iteration 1 : 152/189 places, 179/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20200 ms. Remains : 152/189 places, 179/217 transitions.
[2024-05-30 01:27:21] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:27:22] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:27:22] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-30 01:27:22] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:27:22] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:27:22] [INFO ] Time to serialize gal into /tmp/CTLFireability6724365546033531162.gal : 2 ms
[2024-05-30 01:27:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10129088319980038.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/CTLFireability6724365546033531162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10129088319980038.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 -...281
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,7.45427e+09,0.643397,16264,2,4620,5,61721,6,0,789,46151,0


Converting to forward existential form...Done !
original formula: (AF(EG(((p2==0)||(p151==0)))) * (EF(AX(FALSE)) + (!(A(!((((p136==1)||((p57==1)&&(p249==1))) * EG((p129==1)))) U EF((((p115==1)&&(p198==1)...278
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((p2==0)||(p151==0)))))] = FALSE * ([(((Init * !(E(TRUE U !(EX(!(FALSE)))))) * !(EG(!(E(TRUE U ...616
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t101, t122, t124, t152, Intersection with reachable at each step enabled. (de...200
Detected timeout of ITS tools.
[2024-05-30 01:27:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:27:52] [INFO ] Applying decomposition
[2024-05-30 01:27:52] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1136756255490575821.txt' '-o' '/tmp/graph1136756255490575821.bin' '-w' '/tmp/graph1136756255490575821.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1136756255490575821.bin' '-l' '-1' '-v' '-w' '/tmp/graph1136756255490575821.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:27:52] [INFO ] Decomposing Gal with order
[2024-05-30 01:27:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:27:52] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-30 01:27:52] [INFO ] Flatten gal took : 56 ms
[2024-05-30 01:27:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 01:27:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1229404341977614411.gal : 5 ms
[2024-05-30 01:27:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9042056560207624617.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/CTLFireability1229404341977614411.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9042056560207624617.ctl'

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 -...262
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,7.45427e+09,0.076524,5708,287,74,4117,1004,460,4555,87,1988,0


Converting to forward existential form...Done !
original formula: (AF(EG(((i5.i1.u1.p2==0)||(i4.i0.u22.p151==0)))) * (EF(AX(FALSE)) + (!(A(!((((i4.i0.u29.p136==1)||((i8.i0.u12.p57==1)&&(i8.i1.u49.p249==1...419
=> equivalent forward existential formula: ([FwdG(Init,!(EG(((i5.i1.u1.p2==0)||(i4.i0.u22.p151==0)))))] = FALSE * ([(((Init * !(E(TRUE U !(EX(!(FALSE))))))...849
Reverse transition relation is NOT exact ! Due to transitions t15, t101, i5.i1.u1.t152, i5.i1.u46.t13, i5.i1.u47.t12, i8.i0.t122, i8.i0.t124, Intersection...241
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,3.32161,101276,1,0,187397,2360,3010,304565,513,9441,237394
FORMULA SmartHome-PT-10-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 165 transition count 193
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 165 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 165 transition count 192
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 157 transition count 184
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 157 transition count 184
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 72 place count 150 transition count 177
Iterating global reduction 1 with 7 rules applied. Total rules applied 79 place count 150 transition count 177
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 82 place count 147 transition count 174
Iterating global reduction 1 with 3 rules applied. Total rules applied 85 place count 147 transition count 174
Applied a total of 85 rules in 7 ms. Remains 147 /189 variables (removed 42) and now considering 174/217 (removed 43) transitions.
// Phase 1: matrix 174 rows 147 cols
[2024-05-30 01:27:55] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:27:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 01:27:55] [INFO ] Invariant cache hit.
[2024-05-30 01:27:56] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-30 01:27:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 3 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:27:58] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 3 ms to minimize.
[2024-05-30 01:27:59] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/163 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 163 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9415 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/147 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 174/321 variables, 147/163 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 173/336 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 336 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6946 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 4/4 constraints]
After SMT, in 16382ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 16384ms
Starting structural reductions in LTL mode, iteration 1 : 147/189 places, 174/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16727 ms. Remains : 147/189 places, 174/217 transitions.
[2024-05-30 01:28:12] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:28:12] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:28:12] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-30 01:28:12] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:28:12] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:12] [INFO ] Time to serialize gal into /tmp/CTLFireability18197138959932467494.gal : 2 ms
[2024-05-30 01:28:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14433246136356068158.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/CTLFireability18197138959932467494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14433246136356068158.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,6.35281e+09,0.481453,16268,2,4550,5,61756,6,0,764,47469,0


Converting to forward existential form...Done !
original formula: EX((EG(AG((((p123==0)||(p198==0))||(p246==0)))) * (E((p108!=1) U !(EF((p151==1)))) + AG(EX((p211==1))))))
=> equivalent forward existential formula: ([(FwdU((EY(Init) * EG(!(E(TRUE U !((((p123==0)||(p198==0))||(p246==0))))))),(p108!=1)) * !(E(TRUE U (p151==1)))...283
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t84, t85, t86, t101, t147, Intersection with reachable at each step enabled. ...203
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,19.4088,507184,1,0,669,3.1449e+06,386,450,4785,2.85623e+06,786
FORMULA SmartHome-PT-10-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 166 transition count 194
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 166 transition count 194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 166 transition count 193
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 157 transition count 184
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 157 transition count 184
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 74 place count 148 transition count 175
Iterating global reduction 1 with 9 rules applied. Total rules applied 83 place count 148 transition count 175
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 144 transition count 171
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 144 transition count 171
Applied a total of 91 rules in 6 ms. Remains 144 /189 variables (removed 45) and now considering 171/217 (removed 46) transitions.
// Phase 1: matrix 171 rows 144 cols
[2024-05-30 01:28:32] [INFO ] Computed 12 invariants in 4 ms
[2024-05-30 01:28:32] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 01:28:32] [INFO ] Invariant cache hit.
[2024-05-30 01:28:32] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-30 01:28:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 3 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-30 01:28:34] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/159 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-30 01:28:38] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-30 01:28:38] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 161 constraints, problems are : Problem set: 0 solved, 170 unsolved in 11435 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (OVERLAPS) 1/144 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 171/315 variables, 144/161 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 170/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (OVERLAPS) 0/315 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 331 constraints, problems are : Problem set: 0 solved, 170 unsolved in 7682 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 5/5 constraints]
After SMT, in 19180ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 19183ms
Starting structural reductions in LTL mode, iteration 1 : 144/189 places, 171/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19457 ms. Remains : 144/189 places, 171/217 transitions.
[2024-05-30 01:28:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:51] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-30 01:28:51] [INFO ] Flatten gal took : 7 ms
[2024-05-30 01:28:51] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:28:51] [INFO ] Time to serialize gal into /tmp/CTLFireability1492294678280679084.gal : 2 ms
[2024-05-30 01:28:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13886001507546365271.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/CTLFireability1492294678280679084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13886001507546365271.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,5.5516e+09,0.0771,5688,2,905,5,7826,6,0,749,8361,0


Converting to forward existential form...Done !
original formula: AX(EF(AG(AF(EX((p150==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(E(TRUE U !(!(EG(!(EX((p150==1)))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t12, t13, t15, t64, t98, t144, Intersection with reachable at each step enabled. (destro...196
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.11921,150632,1,0,689,794147,371,461,4560,1.14323e+06,778
FORMULA SmartHome-PT-10-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 165 transition count 193
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 165 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 49 place count 165 transition count 192
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 156 transition count 183
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 156 transition count 183
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 76 place count 147 transition count 174
Iterating global reduction 1 with 9 rules applied. Total rules applied 85 place count 147 transition count 174
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 89 place count 143 transition count 170
Iterating global reduction 1 with 4 rules applied. Total rules applied 93 place count 143 transition count 170
Applied a total of 93 rules in 7 ms. Remains 143 /189 variables (removed 46) and now considering 170/217 (removed 47) transitions.
// Phase 1: matrix 170 rows 143 cols
[2024-05-30 01:28:56] [INFO ] Computed 12 invariants in 1 ms
[2024-05-30 01:28:56] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 01:28:56] [INFO ] Invariant cache hit.
[2024-05-30 01:28:56] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 169 sub problems to find dead transitions.
[2024-05-30 01:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
[2024-05-30 01:28:59] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-30 01:28:59] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-05-30 01:28:59] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2024-05-30 01:28:59] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (OVERLAPS) 0/313 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 159 constraints, problems are : Problem set: 0 solved, 169 unsolved in 8157 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 169 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/142 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/143 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 5 (OVERLAPS) 170/313 variables, 143/159 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 169/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 8 (OVERLAPS) 0/313 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 169 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 328 constraints, problems are : Problem set: 0 solved, 169 unsolved in 6729 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 4/4 constraints]
After SMT, in 14912ms problems are : Problem set: 0 solved, 169 unsolved
Search for dead transitions found 0 dead transitions in 14915ms
Starting structural reductions in LTL mode, iteration 1 : 143/189 places, 170/217 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15140 ms. Remains : 143/189 places, 170/217 transitions.
[2024-05-30 01:29:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:29:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:29:11] [INFO ] Input system was already deterministic with 170 transitions.
[2024-05-30 01:29:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:29:11] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:29:11] [INFO ] Time to serialize gal into /tmp/CTLFireability13646407642344833332.gal : 1 ms
[2024-05-30 01:29:11] [INFO ] Time to serialize properties into /tmp/CTLFireability6795924392711972585.ctl : 8 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/CTLFireability13646407642344833332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6795924392711972585.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,5.20668e+09,0.433813,14396,2,3776,5,53880,6,0,744,41024,0


Converting to forward existential form...Done !
original formula: AG(EF(AX((A((p192==1) U (p183==1)) * (p120==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(!((!((E(!((p183==1)) U (!((p192==1)) * !((p183==1)))) + EG(!((p183==1))))) *...181
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t15, t97, t143, Intersection with reachable at each step enabled. (destroyed/rever...187
(forward)formula 0,1,14.3916,322760,1,0,658,2.02036e+06,373,376,4425,1.65558e+06,849
FORMULA SmartHome-PT-10-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 217/217 transitions.
Graph (trivial) has 161 edges and 189 vertex of which 67 / 189 are part of one of the 4 SCC in 1 ms
Free SCC test removed 63 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 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 125 transition count 101
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 44 rules applied. Total rules applied 81 place count 89 transition count 93
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 84 transition count 93
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 86 place count 84 transition count 88
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 96 place count 79 transition count 88
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 109 place count 66 transition count 75
Iterating global reduction 3 with 13 rules applied. Total rules applied 122 place count 66 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 128 place count 66 transition count 69
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 132 place count 64 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 132 place count 64 transition count 66
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 134 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 135 place count 62 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 136 place count 62 transition count 65
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 174 place count 43 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 175 place count 43 transition count 45
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 177 place count 42 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 183 place count 42 transition count 38
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 185 place count 40 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 187 place count 38 transition count 36
Applied a total of 187 rules in 20 ms. Remains 38 /189 variables (removed 151) and now considering 36/217 (removed 181) transitions.
[2024-05-30 01:29:26] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
// Phase 1: matrix 33 rows 38 cols
[2024-05-30 01:29:26] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:29:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 01:29:26] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
[2024-05-30 01:29:26] [INFO ] Invariant cache hit.
[2024-05-30 01:29:26] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-30 01:29:26] [INFO ] Redundant transitions in 0 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-30 01:29:26] [INFO ] Flow matrix only has 33 transitions (discarded 3 similar events)
[2024-05-30 01:29:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/70 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/71 variables, and 48 constraints, problems are : Problem set: 0 solved, 26 unsolved in 600 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 32/70 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 26/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 0/70 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/71 variables, and 74 constraints, problems are : Problem set: 0 solved, 26 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 1213ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 1213ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/189 places, 36/217 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1367 ms. Remains : 38/189 places, 36/217 transitions.
[2024-05-30 01:29:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:29:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:29:27] [INFO ] Input system was already deterministic with 36 transitions.
[2024-05-30 01:29:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:29:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 01:29:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11506071033089495964.gal : 1 ms
[2024-05-30 01:29:27] [INFO ] Time to serialize properties into /tmp/CTLFireability6564750097038250786.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/CTLFireability11506071033089495964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6564750097038250786.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,8928,0.052066,4460,2,1498,5,5177,6,0,187,3741,0


Converting to forward existential form...Done !
original formula: AF(AG((EF((p151==0)) + (p89==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((E(TRUE U (p151==0)) + (p89==1)))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.232147,8684,1,0,9,24765,21,3,936,13034,8
FORMULA SmartHome-PT-10-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2024-05-30 01:29:28] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:29:28] [INFO ] Flatten gal took : 5 ms
Total runtime 320928 ms.

BK_STOP 1717032568172

--------------------
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-10"
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-10, 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-171683811400410"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-10.tgz
mv SmartHome-PT-10 execution
cd execution
if [ "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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;