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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 03:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 12 03:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 12 03:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 56K 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-06-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-06-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-06-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717030480948

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-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 00:54:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 00:54:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 00:54:43] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-30 00:54:43] [INFO ] Transformed 219 places.
[2024-05-30 00:54:43] [INFO ] Transformed 254 transitions.
[2024-05-30 00:54:43] [INFO ] Found NUPN structural information;
[2024-05-30 00:54:43] [INFO ] Parsed PT model containing 219 places and 254 transitions and 581 arcs in 431 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 32 ms.
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 18 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-06-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 236/236 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 170 transition count 204
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 170 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 170 transition count 203
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 69 place count 166 transition count 199
Iterating global reduction 1 with 4 rules applied. Total rules applied 73 place count 166 transition count 199
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 164 transition count 197
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 164 transition count 197
Applied a total of 77 rules in 108 ms. Remains 164 /202 variables (removed 38) and now considering 197/236 (removed 39) transitions.
// Phase 1: matrix 197 rows 164 cols
[2024-05-30 00:54:44] [INFO ] Computed 9 invariants in 32 ms
[2024-05-30 00:54:44] [INFO ] Implicit Places using invariants in 436 ms returned []
[2024-05-30 00:54:44] [INFO ] Invariant cache hit.
[2024-05-30 00:54:45] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-30 00:54:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:54:48] [INFO ] Deduced a trap composed of 20 places in 226 ms of which 46 ms to minimize.
[2024-05-30 00:54:48] [INFO ] Deduced a trap composed of 48 places in 177 ms of which 4 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 4 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 37 places in 134 ms of which 3 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 20 places in 148 ms of which 3 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 4 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-30 00:54:49] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 3 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 6 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-05-30 00:54:50] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:54:52] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 197/361 variables, 164/188 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:54:56] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:55:01] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/361 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 190 constraints, problems are : Problem set: 0 solved, 196 unsolved in 22590 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (OVERLAPS) 1/164 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 17/26 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:55:09] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 3 ms to minimize.
[2024-05-30 00:55:10] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-30 00:55:10] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-30 00:55:10] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:55:12] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2024-05-30 00:55:12] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 2 ms to minimize.
[2024-05-30 00:55:12] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 2 ms to minimize.
[2024-05-30 00:55:12] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (OVERLAPS) 197/361 variables, 164/198 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 196/394 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-30 00:55:15] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 3 ms to minimize.
[2024-05-30 00:55:15] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-30 00:55:16] [INFO ] Deduced a trap composed of 39 places in 100 ms of which 3 ms to minimize.
[2024-05-30 00:55:16] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-30 00:55:16] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 5/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 10 (OVERLAPS) 0/361 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 399 constraints, problems are : Problem set: 0 solved, 196 unsolved in 17023 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 30/30 constraints]
After SMT, in 39867ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 39913ms
Starting structural reductions in LTL mode, iteration 1 : 164/202 places, 197/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40897 ms. Remains : 164/202 places, 197/236 transitions.
Support contains 78 out of 164 places after structural reductions.
[2024-05-30 00:55:25] [INFO ] Flatten gal took : 56 ms
[2024-05-30 00:55:25] [INFO ] Flatten gal took : 32 ms
[2024-05-30 00:55:25] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 77 out of 164 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (274 resets) in 2412 ms. (16 steps per ms) remains 9/64 properties
BEST_FIRST walk for 40003 steps (56 resets) in 244 ms. (163 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (30 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (50 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 121 ms. (327 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (45 resets) in 88 ms. (449 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (50 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (29 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (261 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
[2024-05-30 00:55:26] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 148/164 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-30 00:55:26] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 197/361 variables, 164/174 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-30 00:55:27] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 1/175 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/361 variables, 0/175 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 361/361 variables, and 175 constraints, problems are : Problem set: 2 solved, 7 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 142/155 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 9/164 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/11 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 197/361 variables, 164/175 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 7/182 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-30 00:55:27] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/361 variables, 1/183 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-30 00:55:27] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/361 variables, 1/184 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/361 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/361 variables, 0/184 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 361/361 variables, and 184 constraints, problems are : Problem set: 2 solved, 7 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 164/164 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 4/4 constraints]
After SMT, in 1352ms problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 2 properties in 1595 ms.
Support contains 11 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 197/197 transitions.
Graph (trivial) has 149 edges and 164 vertex of which 66 / 164 are part of one of the 5 SCC in 7 ms
Free SCC test removed 61 places
Drop transitions (Empty/Sink Transition effects.) removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 103 transition count 82
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 42 rules applied. Total rules applied 76 place count 70 transition count 73
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 66 transition count 73
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 80 place count 66 transition count 70
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 86 place count 63 transition count 70
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 99 place count 50 transition count 57
Iterating global reduction 3 with 13 rules applied. Total rules applied 112 place count 50 transition count 57
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 50 transition count 54
Performed 16 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 147 place count 34 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 87 edges and 34 vertex of which 32 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 4 with 10 rules applied. Total rules applied 157 place count 32 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 158 place count 31 transition count 27
Applied a total of 158 rules in 73 ms. Remains 31 /164 variables (removed 133) and now considering 27/197 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 31/164 places, 27/197 transitions.
RANDOM walk for 40000 steps (4556 resets) in 294 ms. (135 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (1049 resets) in 58 ms. (678 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1040 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1515 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
// Phase 1: matrix 27 rows 31 cols
[2024-05-30 00:55:29] [INFO ] Computed 7 invariants in 1 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 27/58 variables, 31/38 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 00:55:29] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/58 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 39 constraints, problems are : Problem set: 0 solved, 4 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-30 00:55:30] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-30 00:55:30] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 27/58 variables, 31/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/58 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 45 constraints, problems are : Problem set: 0 solved, 4 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 31/31 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 280ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 27 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 21 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2024-05-30 00:55:30] [INFO ] Flatten gal took : 21 ms
[2024-05-30 00:55:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-06-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 00:55:30] [INFO ] Flatten gal took : 22 ms
[2024-05-30 00:55:30] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 71 out of 164 places (down from 75) after GAL structural reductions.
Computed a total of 24 stabilizing places and 24 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 136 transition count 169
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 136 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 136 transition count 165
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 129 transition count 158
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 129 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 129 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 125 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 125 transition count 153
Applied a total of 83 rules in 41 ms. Remains 125 /164 variables (removed 39) and now considering 153/197 (removed 44) transitions.
// Phase 1: matrix 153 rows 125 cols
[2024-05-30 00:55:30] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:55:30] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-30 00:55:30] [INFO ] Invariant cache hit.
[2024-05-30 00:55:30] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-30 00:55:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:55:31] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-30 00:55:31] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 1 ms to minimize.
[2024-05-30 00:55:32] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 3 ms to minimize.
[2024-05-30 00:55:32] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 3 ms to minimize.
[2024-05-30 00:55:32] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 2 ms to minimize.
[2024-05-30 00:55:32] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/278 variables, 125/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 140 constraints, problems are : Problem set: 0 solved, 152 unsolved in 6147 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/125 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:55:37] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (OVERLAPS) 153/278 variables, 125/141 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 152/293 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:55:40] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 9 (OVERLAPS) 0/278 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 294 constraints, problems are : Problem set: 0 solved, 152 unsolved in 7507 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 8/8 constraints]
After SMT, in 13688ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 13692ms
Starting structural reductions in LTL mode, iteration 1 : 125/164 places, 153/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14000 ms. Remains : 125/164 places, 153/197 transitions.
[2024-05-30 00:55:44] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:55:44] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:55:44] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-30 00:55:44] [INFO ] Flatten gal took : 17 ms
[2024-05-30 00:55:44] [INFO ] Flatten gal took : 16 ms
[2024-05-30 00:55:44] [INFO ] Time to serialize gal into /tmp/CTLFireability610681603927899003.gal : 8 ms
[2024-05-30 00:55:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15690941090965565764.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/CTLFireability610681603927899003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15690941090965565764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53628e+08,0.454016,11804,2,2817,5,37633,6,0,655,36350,0


Converting to forward existential form...Done !
original formula: (E(((((AX(AG(((p151==1)&&(p208==1)))) * EG(AX((p174==1)))) + AF(E(((p183==1)&&(p194==1)) U (p76==1)))) + (!(EF((p92==1))) + AX((p206==1))...296
=> equivalent forward existential formula: ([(EY(FwdU(FwdU(Init,((((!(EX(!(!(E(TRUE U !(((p151==1)&&(p208==1)))))))) * EG(!(EX(!((p174==1)))))) + !(EG(!(E(...531
Reverse transition relation is NOT exact ! Due to transitions t3, t10, t12, t13, t15, t35, t68, t92, t114, t129, Intersection with reachable at each step ...213
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,9.24464,244748,1,0,633,1.5533e+06,356,425,4248,1.42241e+06,743
FORMULA SmartHome-PT-06-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 139 transition count 172
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 139 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 139 transition count 168
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 131 transition count 160
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 131 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 131 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 76 place count 126 transition count 154
Iterating global reduction 2 with 5 rules applied. Total rules applied 81 place count 126 transition count 154
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 124 transition count 152
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 124 transition count 152
Applied a total of 85 rules in 13 ms. Remains 124 /164 variables (removed 40) and now considering 152/197 (removed 45) transitions.
// Phase 1: matrix 152 rows 124 cols
[2024-05-30 00:55:53] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:55:53] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 00:55:53] [INFO ] Invariant cache hit.
[2024-05-30 00:55:54] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2024-05-30 00:55:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:55:55] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 3 ms to minimize.
[2024-05-30 00:55:55] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-30 00:55:55] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 8 ms to minimize.
[2024-05-30 00:55:55] [INFO ] Deduced a trap composed of 91 places in 97 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:55:56] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:55:58] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 152/276 variables, 124/139 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 8 (OVERLAPS) 0/276 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 139 constraints, problems are : Problem set: 0 solved, 151 unsolved in 8920 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:56:04] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 2 ms to minimize.
[2024-05-30 00:56:04] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:56:05] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 152/276 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/276 variables, 151/293 constraints. Problems are: Problem set: 0 solved, 151 unsolved
[2024-05-30 00:56:07] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 10 (OVERLAPS) 0/276 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 294 constraints, problems are : Problem set: 0 solved, 151 unsolved in 9132 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 10/10 constraints]
After SMT, in 18081ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 18084ms
Starting structural reductions in LTL mode, iteration 1 : 124/164 places, 152/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18292 ms. Remains : 124/164 places, 152/197 transitions.
[2024-05-30 00:56:12] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:56:12] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:12] [INFO ] Input system was already deterministic with 152 transitions.
[2024-05-30 00:56:12] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:56:12] [INFO ] Flatten gal took : 9 ms
[2024-05-30 00:56:12] [INFO ] Time to serialize gal into /tmp/CTLFireability9494057506544538379.gal : 8 ms
[2024-05-30 00:56:12] [INFO ] Time to serialize properties into /tmp/CTLFireability5984283212761368945.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/CTLFireability9494057506544538379.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5984283212761368945.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.51926e+08,0.16732,8440,2,1583,5,23197,6,0,650,21923,0


Converting to forward existential form...Done !
original formula: A((A((AG((p47==1)) + EX((p79==1))) U !((((p41==1)&&(p2==1))&&(p151==1)))) * (p96==1)) U (EF(AG(((p51==1)&&(p137==1)))) + AG(!(AX((p103==1...161
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U !(E(TRUE U !(((p51==1)&&(p137==1)))))) + !(E(TRUE U !(!(!(EX(!((p103==1))))))))))))) ...565
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t14, t34, t67, t69, t86, t89, t114, t128, t132, Intersection with reachable...227
(forward)formula 0,0,2.28698,58040,1,0,271,319857,339,169,3866,235272,411
FORMULA SmartHome-PT-06-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 133 transition count 166
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 133 transition count 166
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 133 transition count 162
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 75 place count 124 transition count 153
Iterating global reduction 1 with 9 rules applied. Total rules applied 84 place count 124 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 124 transition count 152
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 118 transition count 146
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 118 transition count 146
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 116 transition count 144
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 116 transition count 144
Applied a total of 101 rules in 32 ms. Remains 116 /164 variables (removed 48) and now considering 144/197 (removed 53) transitions.
// Phase 1: matrix 144 rows 116 cols
[2024-05-30 00:56:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:56:14] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-30 00:56:14] [INFO ] Invariant cache hit.
[2024-05-30 00:56:14] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 143 sub problems to find dead transitions.
[2024-05-30 00:56:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:56:16] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 3 ms to minimize.
[2024-05-30 00:56:16] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 3 ms to minimize.
[2024-05-30 00:56:16] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 128 constraints, problems are : Problem set: 0 solved, 143 unsolved in 6588 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (OVERLAPS) 144/260 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 143/271 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:56:24] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-30 00:56:24] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 143 unsolved
[2024-05-30 00:56:25] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/260 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 9 (OVERLAPS) 0/260 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 274 constraints, problems are : Problem set: 0 solved, 143 unsolved in 9042 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 6/6 constraints]
After SMT, in 15656ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 15658ms
Starting structural reductions in LTL mode, iteration 1 : 116/164 places, 144/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15921 ms. Remains : 116/164 places, 144/197 transitions.
[2024-05-30 00:56:30] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:56:30] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:30] [INFO ] Input system was already deterministic with 144 transitions.
[2024-05-30 00:56:30] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:30] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:30] [INFO ] Time to serialize gal into /tmp/CTLFireability16356701668094895051.gal : 3 ms
[2024-05-30 00:56:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3523281924561991391.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/CTLFireability16356701668094895051.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3523281924561991391.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,9.50769e+07,0.338701,9980,2,1911,5,30523,6,0,610,28142,0


Converting to forward existential form...Done !
original formula: AG(EX(EF(EG((p11==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U EG((p11==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t34, t66, t86, t120, Intersection with reachable at each step enabled. (de...200
(forward)formula 0,0,5.40654,139096,1,0,493,852219,315,299,3619,756794,673
FORMULA SmartHome-PT-06-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Graph (trivial) has 159 edges and 164 vertex of which 67 / 164 are part of one of the 5 SCC in 0 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 101 transition count 86
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 70 transition count 77
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 77 place count 66 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 65 transition count 76
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 78 place count 65 transition count 71
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 88 place count 60 transition count 71
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 104 place count 44 transition count 55
Iterating global reduction 4 with 16 rules applied. Total rules applied 120 place count 44 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 123 place count 44 transition count 52
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 147 place count 32 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 156 place count 32 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 158 place count 30 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 160 place count 28 transition count 28
Applied a total of 160 rules in 21 ms. Remains 28 /164 variables (removed 136) and now considering 28/197 (removed 169) transitions.
[2024-05-30 00:56:36] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
// Phase 1: matrix 24 rows 28 cols
[2024-05-30 00:56:36] [INFO ] Computed 7 invariants in 0 ms
[2024-05-30 00:56:36] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-30 00:56:36] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-30 00:56:36] [INFO ] Invariant cache hit.
[2024-05-30 00:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 00:56:36] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2024-05-30 00:56:36] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-30 00:56:36] [INFO ] Flow matrix only has 24 transitions (discarded 4 similar events)
[2024-05-30 00:56:36] [INFO ] Invariant cache hit.
[2024-05-30 00:56:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 1/28 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-30 00:56:36] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 23/51 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 19 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 23/51 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 19/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/51 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/52 variables, and 56 constraints, problems are : Problem set: 0 solved, 19 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 1/1 constraints]
After SMT, in 885ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 886ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/164 places, 28/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 997 ms. Remains : 28/164 places, 28/197 transitions.
[2024-05-30 00:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:56:37] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:56:37] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-30 00:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:56:37] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:56:37] [INFO ] Time to serialize gal into /tmp/CTLFireability7118066665840769528.gal : 1 ms
[2024-05-30 00:56:37] [INFO ] Time to serialize properties into /tmp/CTLFireability10170099895610861236.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/CTLFireability7118066665840769528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10170099895610861236.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,544,0.011574,3496,2,109,5,611,6,0,137,460,0


Converting to forward existential form...Done !
original formula: EF(AG(EF((p186==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U (p186==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t15, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.032476,3812,1,0,48,2634,70,27,783,2087,68
FORMULA SmartHome-PT-06-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 134 transition count 167
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 134 transition count 167
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 134 transition count 164
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 72 place count 125 transition count 155
Iterating global reduction 1 with 9 rules applied. Total rules applied 81 place count 125 transition count 155
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 82 place count 125 transition count 154
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 119 transition count 148
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 119 transition count 148
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 117 transition count 146
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 117 transition count 146
Applied a total of 98 rules in 13 ms. Remains 117 /164 variables (removed 47) and now considering 146/197 (removed 51) transitions.
// Phase 1: matrix 146 rows 117 cols
[2024-05-30 00:56:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:56:37] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 00:56:37] [INFO ] Invariant cache hit.
[2024-05-30 00:56:37] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 145 sub problems to find dead transitions.
[2024-05-30 00:56:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
[2024-05-30 00:56:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-30 00:56:38] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/263 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 128 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5836 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 145 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 4 (OVERLAPS) 146/263 variables, 117/128 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 145/273 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 145 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 145 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 273 constraints, problems are : Problem set: 0 solved, 145 unsolved in 5532 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 145/145 constraints, Known Traps: 2/2 constraints]
After SMT, in 11411ms problems are : Problem set: 0 solved, 145 unsolved
Search for dead transitions found 0 dead transitions in 11414ms
Starting structural reductions in LTL mode, iteration 1 : 117/164 places, 146/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11723 ms. Remains : 117/164 places, 146/197 transitions.
[2024-05-30 00:56:48] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:48] [INFO ] Flatten gal took : 11 ms
[2024-05-30 00:56:48] [INFO ] Input system was already deterministic with 146 transitions.
[2024-05-30 00:56:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:48] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:56:48] [INFO ] Time to serialize gal into /tmp/CTLFireability11611557849395922390.gal : 3 ms
[2024-05-30 00:56:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6192043224744111200.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/CTLFireability11611557849395922390.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6192043224744111200.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.42411e+08,0.246249,8144,2,1586,5,21871,6,0,616,20179,0


Converting to forward existential form...Done !
original formula: EG(AX((!(A(AF((p120==1)) U E((p34==1) U (p210==1)))) + AF((p3==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!((!(!((E(!(E((p34==1) U (p210==1))) U (!(!(EG(!((p120==1))))) * !(E((p34==1) U (p210==1))))) + ...223
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t34, t66, t86, t120, t121, Intersection with reachable at each step enable...206
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.1689,414648,1,0,1558,2.40168e+06,336,936,3681,2.77866e+06,1646
FORMULA SmartHome-PT-06-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Graph (trivial) has 155 edges and 164 vertex of which 67 / 164 are part of one of the 5 SCC in 0 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 101 transition count 89
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 64 place count 73 transition count 82
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 68 place count 70 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 69 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 69 place count 69 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 83 place count 62 transition count 74
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 96 place count 49 transition count 61
Iterating global reduction 4 with 13 rules applied. Total rules applied 109 place count 49 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 111 place count 49 transition count 59
Performed 11 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 133 place count 38 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 141 place count 38 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 142 place count 37 transition count 39
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 144 place count 35 transition count 37
Applied a total of 144 rules in 24 ms. Remains 35 /164 variables (removed 129) and now considering 37/197 (removed 160) transitions.
[2024-05-30 00:57:04] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
// Phase 1: matrix 33 rows 35 cols
[2024-05-30 00:57:04] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:57:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 00:57:04] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-30 00:57:04] [INFO ] Invariant cache hit.
[2024-05-30 00:57:04] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-30 00:57:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-30 00:57:04] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-30 00:57:04] [INFO ] Flow matrix only has 33 transitions (discarded 4 similar events)
[2024-05-30 00:57:04] [INFO ] Invariant cache hit.
[2024-05-30 00:57:04] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 4/35 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-30 00:57:04] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 32/67 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/67 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 67/68 variables, and 55 constraints, problems are : Problem set: 0 solved, 30 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 4/35 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 32/67 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 30/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 0/67 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 67/68 variables, and 85 constraints, problems are : Problem set: 0 solved, 30 unsolved in 646 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 35/35 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 1/1 constraints]
After SMT, in 1219ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 1220ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/164 places, 37/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1372 ms. Remains : 35/164 places, 37/197 transitions.
[2024-05-30 00:57:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:05] [INFO ] Input system was already deterministic with 37 transitions.
[2024-05-30 00:57:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:57:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17762194407367110059.gal : 1 ms
[2024-05-30 00:57:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3905402956102017674.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/CTLFireability17762194407367110059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3905402956102017674.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,4072,0.020586,3564,2,307,5,1646,6,0,173,1177,0


Converting to forward existential form...Done !
original formula: !(E(EF(AG(A((p15==1) U (p154==1)))) U AF(E((p114==1) U EG((p8==1))))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U !(E(TRUE U !(!((E(!((p154==1)) U (!((p15==1)) * !((p154==1)))) + EG(!((p154==1)))))))))) * ...201
Reverse transition relation is NOT exact ! Due to transitions t2, t13, t19, t28, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.38801,12328,1,0,259,52462,120,159,1082,61069,310
FORMULA SmartHome-PT-06-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 137 transition count 170
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 137 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 137 transition count 167
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 130 transition count 160
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 130 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 72 place count 130 transition count 159
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 76 place count 126 transition count 155
Iterating global reduction 2 with 4 rules applied. Total rules applied 80 place count 126 transition count 155
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 82 place count 124 transition count 153
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 124 transition count 153
Applied a total of 84 rules in 13 ms. Remains 124 /164 variables (removed 40) and now considering 153/197 (removed 44) transitions.
// Phase 1: matrix 153 rows 124 cols
[2024-05-30 00:57:05] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:57:06] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-30 00:57:06] [INFO ] Invariant cache hit.
[2024-05-30 00:57:06] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 152 sub problems to find dead transitions.
[2024-05-30 00:57:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:57:07] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 3 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 86 places in 98 ms of which 3 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 3 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-30 00:57:08] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-05-30 00:57:09] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/277 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 6 (OVERLAPS) 0/277 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Real declared 277/277 variables, and 142 constraints, problems are : Problem set: 0 solved, 152 unsolved in 8194 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 1 (OVERLAPS) 1/124 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 4 (OVERLAPS) 153/277 variables, 124/142 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 152/294 constraints. Problems are: Problem set: 0 solved, 152 unsolved
[2024-05-30 00:57:17] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/277 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 152 unsolved
At refinement iteration 8 (OVERLAPS) 0/277 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 152 unsolved
No progress, stopping.
After SMT solving in domain Int declared 277/277 variables, and 295 constraints, problems are : Problem set: 0 solved, 152 unsolved in 8420 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 152/152 constraints, Known Traps: 10/10 constraints]
After SMT, in 16654ms problems are : Problem set: 0 solved, 152 unsolved
Search for dead transitions found 0 dead transitions in 16657ms
Starting structural reductions in LTL mode, iteration 1 : 124/164 places, 153/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16962 ms. Remains : 124/164 places, 153/197 transitions.
[2024-05-30 00:57:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:22] [INFO ] Input system was already deterministic with 153 transitions.
[2024-05-30 00:57:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:22] [INFO ] Flatten gal took : 10 ms
[2024-05-30 00:57:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15007534004654204355.gal : 2 ms
[2024-05-30 00:57:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11704708913619421041.ctl : 16 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/CTLFireability15007534004654204355.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11704708913619421041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.73586e+08,0.432084,14516,2,3117,5,52525,6,0,651,45865,0


Converting to forward existential form...Done !
original formula: E(!((AG(AX(FALSE)) + ((p15!=1)&&(p142==1)))) U !((((E((EX(((p2==1)&&(p151==1))) + !(((p90==1)&&(p48==1)))) U (AG((p8==1)) + ((p151==1)&&(...226
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((!(E(TRUE U !(!(EX(!(FALSE)))))) + ((p15!=1)&&(p142==1))))) * !((p8==1))) * !((E((EX(((p2=...318
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t17, t37, t39, t70, t91, t109, t112, t127, t128, Intersection with reachabl...228
Detected timeout of ITS tools.
[2024-05-30 00:57:53] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:57:53] [INFO ] Applying decomposition
[2024-05-30 00:57:53] [INFO ] Flatten gal took : 7 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/graph5164958134176969263.txt' '-o' '/tmp/graph5164958134176969263.bin' '-w' '/tmp/graph5164958134176969263.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5164958134176969263.bin' '-l' '-1' '-v' '-w' '/tmp/graph5164958134176969263.weights' '-q' '0' '-e' '0.001'
[2024-05-30 00:57:53] [INFO ] Decomposing Gal with order
[2024-05-30 00:57:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 00:57:53] [INFO ] Removed a total of 31 redundant transitions.
[2024-05-30 00:57:53] [INFO ] Flatten gal took : 59 ms
[2024-05-30 00:57:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-30 00:57:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12930539182721522020.gal : 5 ms
[2024-05-30 00:57:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17792803973289054540.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/CTLFireability12930539182721522020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17792803973289054540.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 -...264
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.73586e+08,0.114561,7480,295,45,7985,629,355,11874,80,1565,0


Converting to forward existential form...Done !
original formula: E(!((AG(AX(FALSE)) + ((i1.u4.p15!=1)&&(i5.u26.p142==1)))) U !((((E((EX(((i8.u1.p2==1)&&(i4.u28.p151==1))) + !(((i3.u17.p90==1)&&(i2.u8.p4...312
=> equivalent forward existential formula: [(FwdU((((FwdU(Init,!((!(E(TRUE U !(!(EX(!(FALSE)))))) + ((i1.u4.p15!=1)&&(i5.u26.p142==1))))) * !((i8.u1.p8==1)...404
Reverse transition relation is NOT exact ! Due to transitions t17, t37, t70, t91, i1.u4.t112, i2.u8.t109, i4.u20.t39, i4.u36.t0, i8.t5, i8.u1.t127, i8.u1.t...283
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
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 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,6.35364,161128,1,0,310842,1682,2410,539040,432,6671,339543
FORMULA SmartHome-PT-06-CTLFireability-2024-07 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 : 164/164 places, 197/197 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 134 transition count 167
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 134 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 134 transition count 163
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 73 place count 125 transition count 154
Iterating global reduction 1 with 9 rules applied. Total rules applied 82 place count 125 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 125 transition count 153
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 119 transition count 147
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 119 transition count 147
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 117 transition count 145
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 117 transition count 145
Applied a total of 99 rules in 14 ms. Remains 117 /164 variables (removed 47) and now considering 145/197 (removed 52) transitions.
// Phase 1: matrix 145 rows 117 cols
[2024-05-30 00:57:59] [INFO ] Computed 9 invariants in 3 ms
[2024-05-30 00:57:59] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 00:57:59] [INFO ] Invariant cache hit.
[2024-05-30 00:57:59] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2024-05-30 00:57:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:58:01] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 3 ms to minimize.
[2024-05-30 00:58:01] [INFO ] Deduced a trap composed of 70 places in 101 ms of which 3 ms to minimize.
[2024-05-30 00:58:01] [INFO ] Deduced a trap composed of 84 places in 102 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 129 constraints, problems are : Problem set: 0 solved, 144 unsolved in 6841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 145/262 variables, 117/129 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 144/273 constraints. Problems are: Problem set: 0 solved, 144 unsolved
[2024-05-30 00:58:08] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2024-05-30 00:58:09] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/262 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 275 constraints, problems are : Problem set: 0 solved, 144 unsolved in 5966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 117/117 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 5/5 constraints]
After SMT, in 12834ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 12836ms
Starting structural reductions in LTL mode, iteration 1 : 117/164 places, 145/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13071 ms. Remains : 117/164 places, 145/197 transitions.
[2024-05-30 00:58:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:58:12] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:58:12] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-30 00:58:12] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:58:12] [INFO ] Flatten gal took : 7 ms
[2024-05-30 00:58:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17801107948996069000.gal : 3 ms
[2024-05-30 00:58:12] [INFO ] Time to serialize properties into /tmp/CTLFireability16831730087956286838.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/CTLFireability17801107948996069000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16831730087956286838.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.01489e+08,0.289698,10012,2,2036,5,29651,6,0,615,27050,0


Converting to forward existential form...Done !
original formula: EF((EG((p17==0)) * AX(((AF(((p73==0)||(p199==0))) * ((p138==0)||(p55==0))) * (p56==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EG((p17==0))) * !(EX(!(((!(EG(!(((p73==0)||(p199==0))))) * ((p138==0)||(p55==0))) * (p56==1...171
Reverse transition relation is NOT exact ! Due to transitions t0, t5, t9, t12, t14, t34, t66, t86, t118, t121, Intersection with reachable at each step en...211
(forward)formula 0,1,4.82239,130632,1,0,490,794424,320,278,3478,738331,631
FORMULA SmartHome-PT-06-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 138 transition count 171
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 138 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 55 place count 138 transition count 168
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 62 place count 131 transition count 161
Iterating global reduction 1 with 7 rules applied. Total rules applied 69 place count 131 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 131 transition count 160
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 127 transition count 156
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 127 transition count 156
Applied a total of 78 rules in 9 ms. Remains 127 /164 variables (removed 37) and now considering 156/197 (removed 41) transitions.
// Phase 1: matrix 156 rows 127 cols
[2024-05-30 00:58:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:58:17] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-30 00:58:17] [INFO ] Invariant cache hit.
[2024-05-30 00:58:17] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Running 155 sub problems to find dead transitions.
[2024-05-30 00:58:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-30 00:58:19] [INFO ] Deduced a trap composed of 37 places in 122 ms of which 3 ms to minimize.
[2024-05-30 00:58:19] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-30 00:58:19] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-30 00:58:20] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-30 00:58:21] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-30 00:58:21] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (OVERLAPS) 156/283 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 142 constraints, problems are : Problem set: 0 solved, 155 unsolved in 9159 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 155 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/126 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 1 (OVERLAPS) 1/127 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 4 (OVERLAPS) 156/283 variables, 127/142 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 155/297 constraints. Problems are: Problem set: 0 solved, 155 unsolved
[2024-05-30 00:58:30] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 155 unsolved
At refinement iteration 8 (OVERLAPS) 0/283 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 155 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 298 constraints, problems are : Problem set: 0 solved, 155 unsolved in 7863 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 127/127 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 7/7 constraints]
After SMT, in 17043ms problems are : Problem set: 0 solved, 155 unsolved
Search for dead transitions found 0 dead transitions in 17046ms
Starting structural reductions in LTL mode, iteration 1 : 127/164 places, 156/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17286 ms. Remains : 127/164 places, 156/197 transitions.
[2024-05-30 00:58:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:58:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:58:35] [INFO ] Input system was already deterministic with 156 transitions.
[2024-05-30 00:58:35] [INFO ] Flatten gal took : 12 ms
[2024-05-30 00:58:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 00:58:35] [INFO ] Time to serialize gal into /tmp/CTLFireability7647147904813092586.gal : 2 ms
[2024-05-30 00:58:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5587551785453502710.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/CTLFireability7647147904813092586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5587551785453502710.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.18701e+08,0.37129,10336,2,2246,5,29199,6,0,666,29165,0


Converting to forward existential form...Done !
original formula: AG((E(AX(!(AX((p105==1)))) U EF(!(A((p97==1) U (p160==1))))) + ((p50==0) * (EF(((p74==1) + AX((p98==1)))) + EX((p3==1))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(((p50==0) * (E(TRUE U ((p74==1) + !(EX(!((p98==1)))))) + EX((p3==1)))))) * !(E(!(EX(!(!(!...275
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t35, t71, t91, t95, t130, t131, t135, Intersection with reachable at each ...218
(forward)formula 0,1,7.20991,185508,1,0,568,1.19024e+06,349,319,3965,1.03482e+06,715
FORMULA SmartHome-PT-06-CTLFireability-2024-09 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 : 164/164 places, 197/197 transitions.
Graph (trivial) has 150 edges and 164 vertex of which 61 / 164 are part of one of the 5 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 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 107 transition count 95
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 37 rules applied. Total rules applied 68 place count 77 transition count 88
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 74 place count 74 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 77 place count 71 transition count 85
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 77 place count 71 transition count 79
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 89 place count 65 transition count 79
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 102 place count 52 transition count 66
Iterating global reduction 4 with 13 rules applied. Total rules applied 115 place count 52 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 118 place count 52 transition count 63
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 140 place count 41 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 147 place count 41 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 41 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 149 place count 41 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 150 place count 40 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 39 transition count 43
Applied a total of 151 rules in 30 ms. Remains 39 /164 variables (removed 125) and now considering 43/197 (removed 154) transitions.
[2024-05-30 00:58:42] [INFO ] Flow matrix only has 39 transitions (discarded 4 similar events)
// Phase 1: matrix 39 rows 39 cols
[2024-05-30 00:58:42] [INFO ] Computed 8 invariants in 0 ms
[2024-05-30 00:58:42] [INFO ] Implicit Places using invariants in 39 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/164 places, 43/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 43/43 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 74 ms. Remains : 38/164 places, 43/197 transitions.
[2024-05-30 00:58:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:58:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:58:42] [INFO ] Input system was already deterministic with 43 transitions.
[2024-05-30 00:58:42] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:58:42] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:58:42] [INFO ] Time to serialize gal into /tmp/CTLFireability13166684607175538230.gal : 1 ms
[2024-05-30 00:58:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9827062329677212261.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/CTLFireability13166684607175538230.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9827062329677212261.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,6530,0.021675,3620,2,213,5,1575,6,0,192,1241,0


Converting to forward existential form...Done !
original formula: !(E((p172==1) U (E(EF((p130==1)) U E(EF((p122==1)) U ((p131==1)||(p84==1)))) * !((((p147==1) * EG((p11==1))) + AG((p150==1)))))))
=> equivalent forward existential formula: [(FwdU(((FwdU(Init,(p172==1)) * E(E(TRUE U (p130==1)) U E(E(TRUE U (p122==1)) U ((p131==1)||(p84==1))))) * !(((p...211
Reverse transition relation is NOT exact ! Due to transitions t8, t40, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...168
Hit Full ! (commute/partial/dont) 41/0/2
(forward)formula 0,0,0.1721,7108,1,0,102,20399,125,65,1233,16947,158
FORMULA SmartHome-PT-06-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 136 transition count 169
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 136 transition count 169
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 60 place count 136 transition count 165
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 67 place count 129 transition count 158
Iterating global reduction 1 with 7 rules applied. Total rules applied 74 place count 129 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 129 transition count 157
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 125 transition count 153
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 125 transition count 153
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 123 transition count 151
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 123 transition count 151
Applied a total of 87 rules in 11 ms. Remains 123 /164 variables (removed 41) and now considering 151/197 (removed 46) transitions.
// Phase 1: matrix 151 rows 123 cols
[2024-05-30 00:58:42] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 00:58:42] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-30 00:58:42] [INFO ] Invariant cache hit.
[2024-05-30 00:58:42] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 150 sub problems to find dead transitions.
[2024-05-30 00:58:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:58:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-30 00:58:44] [INFO ] Deduced a trap composed of 72 places in 65 ms of which 2 ms to minimize.
[2024-05-30 00:58:44] [INFO ] Deduced a trap composed of 86 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/274 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 0/274 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 135 constraints, problems are : Problem set: 0 solved, 150 unsolved in 7255 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 1 (OVERLAPS) 1/123 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 151/274 variables, 123/135 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 150/285 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:58:53] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/274 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 150 unsolved
[2024-05-30 00:58:54] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 2 ms to minimize.
[2024-05-30 00:58:54] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 288 constraints, problems are : Problem set: 0 solved, 150 unsolved in 8937 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 150/150 constraints, Known Traps: 6/6 constraints]
After SMT, in 16221ms problems are : Problem set: 0 solved, 150 unsolved
Search for dead transitions found 0 dead transitions in 16224ms
Starting structural reductions in LTL mode, iteration 1 : 123/164 places, 151/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16508 ms. Remains : 123/164 places, 151/197 transitions.
[2024-05-30 00:58:59] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:58:59] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:58:59] [INFO ] Input system was already deterministic with 151 transitions.
[2024-05-30 00:58:59] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:58:59] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:58:59] [INFO ] Time to serialize gal into /tmp/CTLFireability18071294537529449784.gal : 2 ms
[2024-05-30 00:58:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12764282048598539208.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/CTLFireability18071294537529449784.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12764282048598539208.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28328e+08,0.239028,8460,2,1706,5,23491,6,0,645,20874,0


Converting to forward existential form...Done !
original formula: EG(AX(((E((p44!=1) U (p177==1)) + (p16==1)) + (p129==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((E((p44!=1) U (p177==1)) + (p16==1)) + (p129==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t14, t36, t69, t89, t111, t127, Intersection with reachable at each step enable...206
(forward)formula 0,1,27.4259,725560,1,0,966,2.75595e+06,330,588,3630,5.9794e+06,964
FORMULA SmartHome-PT-06-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Graph (trivial) has 148 edges and 164 vertex of which 43 / 164 are part of one of the 4 SCC in 1 ms
Free SCC test removed 39 places
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 124 transition count 104
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 52 rules applied. Total rules applied 95 place count 82 transition count 94
Reduce places removed 5 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 7 rules applied. Total rules applied 102 place count 77 transition count 92
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 106 place count 76 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 109 place count 73 transition count 89
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 109 place count 73 transition count 85
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 117 place count 69 transition count 85
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 133 place count 53 transition count 68
Iterating global reduction 5 with 16 rules applied. Total rules applied 149 place count 53 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 153 place count 53 transition count 64
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 179 place count 40 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 180 place count 40 transition count 50
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 7 with 2 rules applied. Total rules applied 182 place count 39 transition count 49
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 183 place count 39 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 191 place count 39 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 192 place count 38 transition count 40
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 194 place count 38 transition count 40
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 196 place count 36 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 197 place count 35 transition count 38
Applied a total of 197 rules in 27 ms. Remains 35 /164 variables (removed 129) and now considering 38/197 (removed 159) transitions.
[2024-05-30 00:59:26] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
// Phase 1: matrix 35 rows 35 cols
[2024-05-30 00:59:26] [INFO ] Computed 7 invariants in 1 ms
[2024-05-30 00:59:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 00:59:26] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
[2024-05-30 00:59:26] [INFO ] Invariant cache hit.
[2024-05-30 00:59:26] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-30 00:59:26] [INFO ] Redundant transitions in 1 ms returned []
Running 26 sub problems to find dead transitions.
[2024-05-30 00:59:26] [INFO ] Flow matrix only has 35 transitions (discarded 3 similar events)
[2024-05-30 00:59:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 34/69 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 0/69 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/70 variables, and 42 constraints, problems are : Problem set: 0 solved, 26 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 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/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 3/35 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 34/69 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 26/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 7 (OVERLAPS) 0/69 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/70 variables, and 68 constraints, problems are : Problem set: 0 solved, 26 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 0/0 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 26 unsolved
Search for dead transitions found 0 dead transitions in 844ms
Starting structural reductions in SI_CTL mode, iteration 1 : 35/164 places, 38/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 975 ms. Remains : 35/164 places, 38/197 transitions.
[2024-05-30 00:59:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 00:59:27] [INFO ] Flatten gal took : 2 ms
[2024-05-30 00:59:27] [INFO ] Input system was already deterministic with 38 transitions.
[2024-05-30 00:59:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:27] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17175594173432900199.gal : 1 ms
[2024-05-30 00:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability8025376666238027436.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/CTLFireability17175594173432900199.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8025376666238027436.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,3360,0.01315,3596,2,113,5,675,6,0,177,542,0


Converting to forward existential form...Done !
original formula: AG((EG((AF((p209==0)) + ((EG((p64==1)) * (p56==1)) * ((p50==0)&&((p215==0)||(p218==0)))))) * ((p151==0)||(p208==0))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EG((!(EG(!((p209==0)))) + ((EG((p64==1)) * (p56==1)) * ((p50==0)&&((p215==0)||(p218==0)))...228
(forward)formula 0,0,0.015061,3916,1,0,7,675,9,2,188,542,1
FORMULA SmartHome-PT-06-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 135 transition count 168
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 135 transition count 168
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 135 transition count 165
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 70 place count 126 transition count 156
Iterating global reduction 1 with 9 rules applied. Total rules applied 79 place count 126 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 80 place count 126 transition count 155
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 86 place count 120 transition count 149
Iterating global reduction 2 with 6 rules applied. Total rules applied 92 place count 120 transition count 149
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 118 transition count 147
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 118 transition count 147
Applied a total of 96 rules in 13 ms. Remains 118 /164 variables (removed 46) and now considering 147/197 (removed 50) transitions.
// Phase 1: matrix 147 rows 118 cols
[2024-05-30 00:59:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 00:59:27] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-30 00:59:27] [INFO ] Invariant cache hit.
[2024-05-30 00:59:27] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 146 sub problems to find dead transitions.
[2024-05-30 00:59:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 3 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-30 00:59:29] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-30 00:59:30] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/265 variables, 118/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 0/265 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 265/265 variables, and 135 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (OVERLAPS) 1/118 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (OVERLAPS) 147/265 variables, 118/135 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 146/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (OVERLAPS) 0/265 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 265/265 variables, and 281 constraints, problems are : Problem set: 0 solved, 146 unsolved in 5171 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 118/118 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 8/8 constraints]
After SMT, in 12438ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 12441ms
Starting structural reductions in LTL mode, iteration 1 : 118/164 places, 147/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12672 ms. Remains : 118/164 places, 147/197 transitions.
[2024-05-30 00:59:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:59:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:59:40] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-30 00:59:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:59:40] [INFO ] Flatten gal took : 4 ms
[2024-05-30 00:59:40] [INFO ] Time to serialize gal into /tmp/CTLFireability2629129857657859532.gal : 1 ms
[2024-05-30 00:59:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3073708925179626649.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/CTLFireability2629129857657859532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3073708925179626649.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.12218e+08,0.288808,12140,2,2234,5,39922,6,0,621,36106,0


Converting to forward existential form...Done !
original formula: EF(AX((!(E((p5==1) U (p190==1))) + ((p73==1)&&(p199==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(E((p5==1) U (p190==1))) + ((p73==1)&&(p199==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t12, t13, t15, t35, t67, t87, t121, t122, Intersection with reachable at each step e...212
(forward)formula 0,1,6.245,164052,1,0,607,1.06097e+06,315,335,3433,897769,723
FORMULA SmartHome-PT-06-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 164/164 places, 197/197 transitions.
Graph (trivial) has 155 edges and 164 vertex of which 67 / 164 are part of one of the 5 SCC in 1 ms
Free SCC test removed 62 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 101 transition count 84
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 42 rules applied. Total rules applied 76 place count 68 transition count 75
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 64 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 80 place count 64 transition count 71
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 88 place count 60 transition count 71
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 105 place count 43 transition count 54
Iterating global reduction 3 with 17 rules applied. Total rules applied 122 place count 43 transition count 54
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 125 place count 43 transition count 51
Performed 12 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 149 place count 31 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 158 place count 31 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 160 place count 29 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 27 transition count 27
Applied a total of 162 rules in 11 ms. Remains 27 /164 variables (removed 137) and now considering 27/197 (removed 170) transitions.
[2024-05-30 00:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 27 cols
[2024-05-30 00:59:46] [INFO ] Computed 7 invariants in 0 ms
[2024-05-30 00:59:46] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 00:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-30 00:59:46] [INFO ] Invariant cache hit.
[2024-05-30 00:59:46] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-30 00:59:46] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-30 00:59:46] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
[2024-05-30 00:59:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 0/49 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 49/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 16 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 22/49 variables, 27/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 0/49 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 49/50 variables, and 50 constraints, problems are : Problem set: 0 solved, 16 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 430ms
Starting structural reductions in SI_CTL mode, iteration 1 : 27/164 places, 27/197 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 515 ms. Remains : 27/164 places, 27/197 transitions.
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:47] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 1 ms
[2024-05-30 00:59:47] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5629792086481357622.gal : 0 ms
[2024-05-30 00:59:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10173960922941721178.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5629792086481357622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10173960922941721178.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (5819 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality10173960922941721178.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 64
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :64 after 208
Reachability property SmartHome-PT-06-CTLFireability-2023-15 is true.
FORMULA SmartHome-PT-06-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,416,0.01877,3552,2,87,10,641,6,0,133,416,0
Total reachable state count : 416

Verifying 1 reachability properties.
Reachability property SmartHome-PT-06-CTLFireability-2023-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SmartHome-PT-06-CTLFireability-2023-15,1,0.019533,3912,2,28,10,641,7,0,147,416,0
BEST_FIRST walk for 40003 steps (1722 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 111 steps, run visited all 1 properties in 7 ms. (steps per millisecond=15 )
Probabilistic random walk after 111 steps, saw 83 distinct states, run finished after 12 ms. (steps per millisecond=9 ) properties seen :1
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 5 ms
[2024-05-30 00:59:47] [INFO ] Flatten gal took : 5 ms
Total runtime 303908 ms.

BK_STOP 1717030787452

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

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-06.tgz
mv SmartHome-PT-06 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 ;