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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 03:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 12 03:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K 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-08-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-08-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-08-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-08-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-08-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-08-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717031299483

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 01:08:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 01:08:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 01:08:22] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-05-30 01:08:22] [INFO ] Transformed 252 places.
[2024-05-30 01:08:22] [INFO ] Transformed 291 transitions.
[2024-05-30 01:08:22] [INFO ] Found NUPN structural information;
[2024-05-30 01:08:22] [INFO ] Parsed PT model containing 252 places and 291 transitions and 664 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 21 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-08-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 270/270 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 182 transition count 220
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 182 transition count 220
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 104 place count 182 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 178 transition count 212
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 178 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 177 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 177 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 176 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 176 transition count 210
Applied a total of 116 rules in 217 ms. Remains 176 /232 variables (removed 56) and now considering 210/270 (removed 60) transitions.
// Phase 1: matrix 210 rows 176 cols
[2024-05-30 01:08:23] [INFO ] Computed 11 invariants in 55 ms
[2024-05-30 01:08:23] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-30 01:08:23] [INFO ] Invariant cache hit.
[2024-05-30 01:08:23] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-30 01:08:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 01:08:27] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 41 ms to minimize.
[2024-05-30 01:08:27] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 4 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 4 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 39 places in 131 ms of which 4 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 4 ms to minimize.
[2024-05-30 01:08:28] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 4 ms to minimize.
[2024-05-30 01:08:29] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-30 01:08:29] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-30 01:08:29] [INFO ] Deduced a trap composed of 43 places in 115 ms of which 3 ms to minimize.
[2024-05-30 01:08:29] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 01:08:31] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (OVERLAPS) 210/386 variables, 176/201 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-30 01:08:34] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 202 constraints, problems are : Problem set: 0 solved, 209 unsolved in 16542 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/386 variables, 176/202 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 209/411 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 411 constraints, problems are : Problem set: 0 solved, 209 unsolved in 12404 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 15/15 constraints]
After SMT, in 29134ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 29170ms
Starting structural reductions in LTL mode, iteration 1 : 176/232 places, 210/270 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30450 ms. Remains : 176/232 places, 210/270 transitions.
Support contains 60 out of 176 places after structural reductions.
[2024-05-30 01:08:53] [INFO ] Flatten gal took : 57 ms
[2024-05-30 01:08:53] [INFO ] Flatten gal took : 22 ms
[2024-05-30 01:08:53] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 54 out of 176 places (down from 60) after GAL structural reductions.
FORMULA SmartHome-PT-08-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (248 resets) in 2612 ms. (15 steps per ms) remains 3/41 properties
BEST_FIRST walk for 40003 steps (44 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (28 resets) in 124 ms. (320 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (25 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
[2024-05-30 01:08:54] [INFO ] Invariant cache hit.
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, 3 unsolved
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 100/110 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 66/176 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 210/386 variables, 176/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/386 variables, 0/187 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 187 constraints, problems are : Problem set: 2 solved, 1 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 106/110 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-05-30 01:08:55] [INFO ] Deduced a trap composed of 39 places in 60 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 66/176 variables, 5/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 210/386 variables, 176/188 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/386 variables, 0/189 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 189 constraints, problems are : Problem set: 2 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 176/176 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 504ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 176/176 places, 210/210 transitions.
Graph (trivial) has 162 edges and 176 vertex of which 67 / 176 are part of one of the 5 SCC in 5 ms
Free SCC test removed 62 places
Drop transitions (Empty/Sink Transition effects.) removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 114 transition count 90
Reduce places removed 36 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 45 rules applied. Total rules applied 82 place count 78 transition count 81
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 87 place count 74 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 73 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 88 place count 73 transition count 74
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 100 place count 67 transition count 74
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 109 place count 58 transition count 65
Iterating global reduction 4 with 9 rules applied. Total rules applied 118 place count 58 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 58 transition count 63
Performed 21 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 162 place count 37 transition count 40
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 171 place count 37 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 173 place count 37 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 174 place count 36 transition count 29
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 179 place count 36 transition count 24
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 184 place count 31 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 185 place count 30 transition count 23
Reduce places removed 4 places and 0 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 8 with 8 rules applied. Total rules applied 193 place count 26 transition count 19
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 197 place count 22 transition count 19
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 2 Pre rules applied. Total rules applied 197 place count 22 transition count 17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 201 place count 20 transition count 17
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 202 place count 20 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 203 place count 19 transition count 16
Applied a total of 203 rules in 85 ms. Remains 19 /176 variables (removed 157) and now considering 16/210 (removed 194) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 19/176 places, 16/210 transitions.
RANDOM walk for 40000 steps (8 resets) in 273 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 85 steps, run visited all 1 properties in 8 ms. (steps per millisecond=10 )
Probabilistic random walk after 85 steps, saw 46 distinct states, run finished after 16 ms. (steps per millisecond=5 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2024-05-30 01:08:55] [INFO ] Flatten gal took : 25 ms
[2024-05-30 01:08:55] [INFO ] Flatten gal took : 23 ms
[2024-05-30 01:08:55] [INFO ] Input system was already deterministic with 210 transitions.
Support contains 48 out of 176 places (down from 50) after GAL structural reductions.
Computed a total of 22 stabilizing places and 22 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Graph (trivial) has 170 edges and 176 vertex of which 77 / 176 are part of one of the 6 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 104 transition count 83
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 45 rules applied. Total rules applied 81 place count 69 transition count 73
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 86 place count 65 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 64 transition count 72
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 87 place count 64 transition count 67
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 97 place count 59 transition count 67
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 106 place count 50 transition count 58
Iterating global reduction 4 with 9 rules applied. Total rules applied 115 place count 50 transition count 58
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 117 place count 50 transition count 56
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 149 place count 34 transition count 40
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 158 place count 34 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 33 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 161 place count 31 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 162 place count 30 transition count 29
Applied a total of 162 rules in 35 ms. Remains 30 /176 variables (removed 146) and now considering 29/210 (removed 181) transitions.
[2024-05-30 01:08:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
// Phase 1: matrix 24 rows 30 cols
[2024-05-30 01:08:55] [INFO ] Computed 9 invariants in 2 ms
[2024-05-30 01:08:55] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-30 01:08:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:08:55] [INFO ] Invariant cache hit.
[2024-05-30 01:08:55] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-30 01:08:55] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-30 01:08:55] [INFO ] Flow matrix only has 24 transitions (discarded 5 similar events)
[2024-05-30 01:08:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/53 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/54 variables, and 39 constraints, problems are : Problem set: 0 solved, 15 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 23/53 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/53 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/54 variables, and 54 constraints, problems are : Problem set: 0 solved, 15 unsolved in 350 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 729ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 730ms
Starting structural reductions in SI_CTL mode, iteration 1 : 30/176 places, 29/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 955 ms. Remains : 30/176 places, 29/210 transitions.
[2024-05-30 01:08:56] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:08:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:08:56] [INFO ] Input system was already deterministic with 29 transitions.
[2024-05-30 01:08:56] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:08:56] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:08:56] [INFO ] Time to serialize gal into /tmp/CTLFireability14856985883706969556.gal : 3 ms
[2024-05-30 01:08:56] [INFO ] Time to serialize properties into /tmp/CTLFireability1304605405323063104.ctl : 3 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/CTLFireability14856985883706969556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1304605405323063104.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,3840,0.038169,3396,2,303,5,1292,6,0,146,1064,0


Converting to forward existential form...Done !
original formula: EF(AG((p199==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p199==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,0.073541,4272,1,0,9,5696,15,3,676,3009,5
FORMULA SmartHome-PT-08-CTLFireability-2024-00 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 : 176/176 places, 210/210 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 157 transition count 191
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 157 transition count 191
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 157 transition count 189
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 149 transition count 181
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 149 transition count 181
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 145 transition count 177
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 145 transition count 177
Applied a total of 64 rules in 17 ms. Remains 145 /176 variables (removed 31) and now considering 177/210 (removed 33) transitions.
// Phase 1: matrix 177 rows 145 cols
[2024-05-30 01:08:56] [INFO ] Computed 11 invariants in 8 ms
[2024-05-30 01:08:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 01:08:57] [INFO ] Invariant cache hit.
[2024-05-30 01:08:57] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-30 01:08:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 18 places in 105 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 95 places in 103 ms of which 3 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-30 01:08:59] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-30 01:09:01] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/145 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (OVERLAPS) 177/322 variables, 145/165 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 165 constraints, problems are : Problem set: 0 solved, 176 unsolved in 11122 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (OVERLAPS) 1/145 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/145 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (OVERLAPS) 177/322 variables, 145/165 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 176/341 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 0/322 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 341 constraints, problems are : Problem set: 0 solved, 176 unsolved in 8033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 145/145 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 9/9 constraints]
After SMT, in 19225ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 19231ms
Starting structural reductions in LTL mode, iteration 1 : 145/176 places, 177/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19564 ms. Remains : 145/176 places, 177/210 transitions.
[2024-05-30 01:09:16] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:09:16] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:09:16] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-30 01:09:16] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:09:16] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:09:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10742192694448099464.gal : 13 ms
[2024-05-30 01:09:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3457415376139584687.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10742192694448099464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3457415376139584687.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,4.79656e+09,0.320265,13596,2,3331,5,48248,6,0,759,42262,0


Converting to forward existential form...Done !
original formula: (EF(((p45==0) + AX((p69==0)))) * (A((EX(((p128!=1)&&(p23!=1))) + AX(EX((p201==1)))) U EX((p147==1))) + EX(EF(((EF((p37==1)) * ((((p154==1...221
=> equivalent forward existential formula: ([(((Init * E(TRUE U ((p45==0) + !(EX(!((p69==0))))))) * !(EG(!(EX((p147==1)))))) * !(E(!(EX((p147==1))) U (!((E...422
Reverse transition relation is NOT exact ! Due to transitions t5, t9, t10, t12, t34, t71, t72, t92, t115, t152, Intersection with reachable at each step e...212
Detected timeout of ITS tools.
[2024-05-30 01:09:46] [INFO ] Flatten gal took : 19 ms
[2024-05-30 01:09:46] [INFO ] Applying decomposition
[2024-05-30 01:09:46] [INFO ] Flatten gal took : 17 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/graph17291288138894496444.txt' '-o' '/tmp/graph17291288138894496444.bin' '-w' '/tmp/graph17291288138894496444.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17291288138894496444.bin' '-l' '-1' '-v' '-w' '/tmp/graph17291288138894496444.weights' '-q' '0' '-e' '0.001'
[2024-05-30 01:09:46] [INFO ] Decomposing Gal with order
[2024-05-30 01:09:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 01:09:46] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-30 01:09:46] [INFO ] Flatten gal took : 62 ms
[2024-05-30 01:09:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-30 01:09:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10037522556578536319.gal : 8 ms
[2024-05-30 01:09:46] [INFO ] Time to serialize properties into /tmp/CTLFireability3882366597030961764.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/CTLFireability10037522556578536319.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3882366597030961764.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 -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.79656e+09,0.103722,6380,321,38,6373,486,411,8053,75,1170,0


Converting to forward existential form...Done !
original formula: (EF(((i0.i1.u10.p45==0) + AX((i1.u13.p69==0)))) * (A((EX(((i4.u24.p128!=1)&&(i0.i1.u5.p23!=1))) + AX(EX((i7.u39.p201==1)))) U EX((i6.i0.u...330
=> equivalent forward existential formula: ([(((Init * E(TRUE U ((i0.i1.u10.p45==0) + !(EX(!((i1.u13.p69==0))))))) * !(EG(!(EX((i6.i0.u27.p147==1)))))) * !...568
Reverse transition relation is NOT exact ! Due to transitions t12, t92, t115, i4.u21.t71, i4.u26.t72, i6.i1.t34, i8.t5, i8.u2.t152, i8.u41.t10, i8.u42.t9, ...255
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an 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,9.25147,242132,1,0,429827,1053,2953,653006,447,3102,503231
FORMULA SmartHome-PT-08-CTLFireability-2024-01 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 : 176/176 places, 210/210 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 189
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 155 transition count 187
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 56 place count 143 transition count 175
Iterating global reduction 1 with 12 rules applied. Total rules applied 68 place count 143 transition count 175
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 136 transition count 168
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 136 transition count 168
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 135 transition count 167
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 135 transition count 167
Applied a total of 84 rules in 13 ms. Remains 135 /176 variables (removed 41) and now considering 167/210 (removed 43) transitions.
// Phase 1: matrix 167 rows 135 cols
[2024-05-30 01:09:56] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:09:56] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 01:09:56] [INFO ] Invariant cache hit.
[2024-05-30 01:09:56] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-30 01:09:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-30 01:09:58] [INFO ] Deduced a trap composed of 30 places in 135 ms of which 26 ms to minimize.
[2024-05-30 01:09:58] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-30 01:09:59] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-30 01:10:00] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 3 ms to minimize.
[2024-05-30 01:10:00] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 167/302 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 302/302 variables, and 151 constraints, problems are : Problem set: 0 solved, 166 unsolved in 10266 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/302 variables, 135/151 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/302 variables, 166/317 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/302 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 302/302 variables, and 317 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7644 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 5/5 constraints]
After SMT, in 17965ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 17970ms
Starting structural reductions in LTL mode, iteration 1 : 135/176 places, 167/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18226 ms. Remains : 135/176 places, 167/210 transitions.
[2024-05-30 01:10:14] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:10:14] [INFO ] Flatten gal took : 13 ms
[2024-05-30 01:10:14] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-30 01:10:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:14] [INFO ] Time to serialize gal into /tmp/CTLFireability6287002552133475575.gal : 7 ms
[2024-05-30 01:10:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7817991628338466685.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/CTLFireability6287002552133475575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7817991628338466685.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,3.40348e+09,0.440414,11980,2,2530,5,40548,6,0,709,35379,0


Converting to forward existential form...Done !
original formula: E(AG(!(EX(A((p30==1) U (p152==1))))) U EF(AG((p93==1))))
=> equivalent forward existential formula: [(FwdU(FwdU(Init,!(E(TRUE U !(!(EX(!((E(!((p152==1)) U (!((p30==1)) * !((p152==1)))) + EG(!((p152==1))))))))))),...198
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t66, t86, t107, t142, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,1.9455,44796,1,0,200,190898,356,138,4003,149109,344
FORMULA SmartHome-PT-08-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Graph (trivial) has 163 edges and 176 vertex of which 53 / 176 are part of one of the 5 SCC in 1 ms
Free SCC test removed 48 places
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 127 transition count 98
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 62 rules applied. Total rules applied 112 place count 78 transition count 85
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 121 place count 71 transition count 83
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 123 place count 70 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 69 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 124 place count 69 transition count 78
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 132 place count 65 transition count 78
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 142 place count 55 transition count 68
Iterating global reduction 5 with 10 rules applied. Total rules applied 152 place count 55 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 155 place count 55 transition count 65
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 156 place count 54 transition count 64
Iterating global reduction 6 with 1 rules applied. Total rules applied 157 place count 54 transition count 64
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 191 place count 37 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 193 place count 37 transition count 45
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 195 place count 36 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 205 place count 36 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 206 place count 35 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 208 place count 33 transition count 32
Applied a total of 208 rules in 32 ms. Remains 33 /176 variables (removed 143) and now considering 32/210 (removed 178) transitions.
[2024-05-30 01:10:16] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
// Phase 1: matrix 28 rows 33 cols
[2024-05-30 01:10:16] [INFO ] Computed 10 invariants in 1 ms
[2024-05-30 01:10:16] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-30 01:10:16] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-30 01:10:16] [INFO ] Invariant cache hit.
[2024-05-30 01:10:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-30 01:10:16] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-30 01:10:16] [INFO ] Flow matrix only has 28 transitions (discarded 4 similar events)
[2024-05-30 01:10:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 4/33 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 27/60 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/61 variables, and 43 constraints, problems are : Problem set: 0 solved, 18 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 4/33 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 27/60 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/61 variables, and 61 constraints, problems are : Problem set: 0 solved, 18 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 33/33 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 806ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 806ms
Starting structural reductions in SI_CTL mode, iteration 1 : 33/176 places, 32/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1022 ms. Remains : 33/176 places, 32/210 transitions.
[2024-05-30 01:10:17] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:17] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:17] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-30 01:10:17] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:17] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability4068038301493224086.gal : 1 ms
[2024-05-30 01:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability16888557148579744695.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/CTLFireability4068038301493224086.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16888557148579744695.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,9792,0.027176,3568,2,175,5,920,6,0,162,748,0


Converting to forward existential form...Done !
original formula: A(EF(EG(A(((p185==1)&&(p246==1)) U (p7==1)))) U EF((p93==1)))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (p93==1)))))) * !(E(!(E(TRUE U (p93==1))) U (!(E(TRUE U EG(!((E(!((p7==1)) U (!(((p185...247
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 30/0/2
Hit Full ! (commute/partial/dont) 30/0/2
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,0.175589,7320,1,0,45,21039,37,33,899,21436,40
FORMULA SmartHome-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 189
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 155 transition count 187
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 144 transition count 176
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 144 transition count 176
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 74 place count 136 transition count 168
Iterating global reduction 1 with 8 rules applied. Total rules applied 82 place count 136 transition count 168
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 136 transition count 167
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 135 transition count 166
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 135 transition count 166
Applied a total of 85 rules in 15 ms. Remains 135 /176 variables (removed 41) and now considering 166/210 (removed 44) transitions.
// Phase 1: matrix 166 rows 135 cols
[2024-05-30 01:10:17] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:10:17] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-30 01:10:17] [INFO ] Invariant cache hit.
[2024-05-30 01:10:18] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2024-05-30 01:10:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 16 ms to minimize.
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-30 01:10:20] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-30 01:10:22] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (OVERLAPS) 166/301 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 153 constraints, problems are : Problem set: 0 solved, 165 unsolved in 9965 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (OVERLAPS) 1/135 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/135 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 166/301 variables, 135/153 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 165/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (OVERLAPS) 0/301 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 301/301 variables, and 318 constraints, problems are : Problem set: 0 solved, 165 unsolved in 7929 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints]
After SMT, in 17937ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 17943ms
Starting structural reductions in LTL mode, iteration 1 : 135/176 places, 166/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18301 ms. Remains : 135/176 places, 166/210 transitions.
[2024-05-30 01:10:36] [INFO ] Flatten gal took : 10 ms
[2024-05-30 01:10:36] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:10:36] [INFO ] Input system was already deterministic with 166 transitions.
[2024-05-30 01:10:36] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:10:36] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:10:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3621897096621250501.gal : 2 ms
[2024-05-30 01:10:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13489435176608724947.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/CTLFireability3621897096621250501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13489435176608724947.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.39083e+09,0.440155,11980,2,2506,5,40377,6,0,708,35291,0


Converting to forward existential form...Done !
original formula: AG((EG(EF(AX((p71==0)))) + ((EF((p243==0)) * (p173==0)) * (EG(((p2==1)&&(p185==1))) * AG((AG((p185==1)) + AF((p86==1))))))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(EG(E(TRUE U !(EX(!((p71==0)))))))) * !(E(TRUE U (p243==0))))] = FALSE * [((FwdU(Init,TR...456
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t65, t85, t107, t141, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,2.86548,71744,1,0,286,395546,375,182,4228,286014,455
FORMULA SmartHome-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Graph (trivial) has 169 edges and 176 vertex of which 77 / 176 are part of one of the 6 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 104 transition count 83
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 46 rules applied. Total rules applied 82 place count 69 transition count 72
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 88 place count 64 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 63 transition count 71
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 89 place count 63 transition count 67
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 59 transition count 67
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 105 place count 51 transition count 59
Iterating global reduction 4 with 8 rules applied. Total rules applied 113 place count 51 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 51 transition count 58
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 146 place count 35 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 156 place count 35 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 157 place count 34 transition count 32
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 159 place count 32 transition count 30
Applied a total of 159 rules in 32 ms. Remains 32 /176 variables (removed 144) and now considering 30/210 (removed 180) transitions.
[2024-05-30 01:10:39] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
// Phase 1: matrix 25 rows 32 cols
[2024-05-30 01:10:39] [INFO ] Computed 10 invariants in 3 ms
[2024-05-30 01:10:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 01:10:39] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-30 01:10:39] [INFO ] Invariant cache hit.
[2024-05-30 01:10:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-30 01:10:39] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-30 01:10:39] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2024-05-30 01:10:39] [INFO ] Flow matrix only has 25 transitions (discarded 5 similar events)
[2024-05-30 01:10:39] [INFO ] Invariant cache hit.
[2024-05-30 01:10:39] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 4/32 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 24/56 variables, 32/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-30 01:10:39] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/56 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 4/32 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 24/56 variables, 32/43 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 61 constraints, problems are : Problem set: 0 solved, 17 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 32/32 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 994ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 994ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/176 places, 30/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1170 ms. Remains : 32/176 places, 30/210 transitions.
[2024-05-30 01:10:40] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:10:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:10:40] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-30 01:10:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:10:40] [INFO ] Flatten gal took : 2 ms
[2024-05-30 01:10:40] [INFO ] Time to serialize gal into /tmp/CTLFireability674159634402933338.gal : 1 ms
[2024-05-30 01:10:40] [INFO ] Time to serialize properties into /tmp/CTLFireability15799680202168118621.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/CTLFireability674159634402933338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15799680202168118621.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,7296,0.015519,3548,2,217,5,959,6,0,154,759,0


Converting to forward existential form...Done !
original formula: AG(EF(((p12==1)||(p48==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p12==1)||(p48==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t20, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :...164
(forward)formula 0,0,0.082358,4924,1,0,57,8818,73,29,893,6941,64
FORMULA SmartHome-PT-08-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 155 transition count 189
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 155 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 155 transition count 187
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 145 transition count 177
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 145 transition count 177
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 138 transition count 170
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 138 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 137 transition count 169
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 137 transition count 169
Applied a total of 80 rules in 26 ms. Remains 137 /176 variables (removed 39) and now considering 169/210 (removed 41) transitions.
// Phase 1: matrix 169 rows 137 cols
[2024-05-30 01:10:40] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:10:40] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-30 01:10:40] [INFO ] Invariant cache hit.
[2024-05-30 01:10:40] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 01:10:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 01:10:42] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 3 ms to minimize.
[2024-05-30 01:10:42] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-30 01:10:42] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 3 ms to minimize.
[2024-05-30 01:10:42] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 2 ms to minimize.
[2024-05-30 01:10:43] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-30 01:10:43] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-30 01:10:43] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/306 variables, 137/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/306 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 155 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9432 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 01:10:51] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-30 01:10:51] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/137 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 169/306 variables, 137/157 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 168/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 325 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9068 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 9/9 constraints]
After SMT, in 18536ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 18540ms
Starting structural reductions in LTL mode, iteration 1 : 137/176 places, 169/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18840 ms. Remains : 137/176 places, 169/210 transitions.
[2024-05-30 01:10:59] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:59] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:59] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-30 01:10:59] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:59] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:10:59] [INFO ] Time to serialize gal into /tmp/CTLFireability2969783789401108683.gal : 3 ms
[2024-05-30 01:10:59] [INFO ] Time to serialize properties into /tmp/CTLFireability10013257025531927184.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/CTLFireability2969783789401108683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10013257025531927184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.65171e+09,0.515437,13848,2,2697,5,48668,6,0,719,43201,0


Converting to forward existential form...Done !
original formula: A((A(AX(FALSE) U AF((((p196==1)||(p185==1))&&(p150==1)))) * EF(((p248==1)&&(p251==1)))) U AG(!(AG(A((p131==1) U (p209==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(!(!(E(TRUE U !(!((E(!((p209==1)) U (!((p131==1)) * !((p209==1)))) + EG(!((p209==1)...641
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t34, t70, t90, t110, t144, Intersection with reachable at each step enabled. (...202
(forward)formula 0,1,9.14978,225796,1,0,601,1.40913e+06,377,347,4266,1.26691e+06,782
FORMULA SmartHome-PT-08-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Graph (trivial) has 159 edges and 176 vertex of which 46 / 176 are part of one of the 5 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 134 transition count 107
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 60 rules applied. Total rules applied 109 place count 86 transition count 95
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 118 place count 79 transition count 93
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 122 place count 78 transition count 90
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 125 place count 75 transition count 90
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 125 place count 75 transition count 84
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 137 place count 69 transition count 84
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 146 place count 60 transition count 75
Iterating global reduction 5 with 9 rules applied. Total rules applied 155 place count 60 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 159 place count 60 transition count 71
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 160 place count 59 transition count 70
Iterating global reduction 6 with 1 rules applied. Total rules applied 161 place count 59 transition count 70
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 193 place count 43 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 203 place count 43 transition count 44
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 205 place count 42 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 206 place count 41 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 41 transition count 42
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 208 place count 41 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 209 place count 41 transition count 41
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 211 place count 39 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 212 place count 38 transition count 39
Applied a total of 212 rules in 45 ms. Remains 38 /176 variables (removed 138) and now considering 39/210 (removed 171) transitions.
[2024-05-30 01:11:08] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 38 cols
[2024-05-30 01:11:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-30 01:11:08] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 01:11:08] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2024-05-30 01:11:08] [INFO ] Invariant cache hit.
[2024-05-30 01:11:08] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-05-30 01:11:08] [INFO ] Redundant transitions in 0 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-30 01:11:08] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
[2024-05-30 01:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-05-30 01:11:08] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/72 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 0/72 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 48 constraints, problems are : Problem set: 0 solved, 25 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (OVERLAPS) 3/38 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 34/72 variables, 38/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/72 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 73 constraints, problems are : Problem set: 0 solved, 25 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 38/38 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
After SMT, in 1231ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 1232ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/176 places, 39/210 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1428 ms. Remains : 38/176 places, 39/210 transitions.
[2024-05-30 01:11:09] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:11:09] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:11:09] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 01:11:09] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:11:09] [INFO ] Flatten gal took : 3 ms
[2024-05-30 01:11:09] [INFO ] Time to serialize gal into /tmp/CTLFireability13914603029336126699.gal : 1 ms
[2024-05-30 01:11:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16895688039480926543.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/CTLFireability13914603029336126699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16895688039480926543.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,26752,0.019496,3604,2,184,5,1022,6,0,189,803,0


Converting to forward existential form...Done !
original formula: E((p25==1) U ((p182==1) + EF((((p185==1)&&(p250==1)) + E(EF((p164==1)) U ((p164==1)||(p125==1)))))))
=> equivalent forward existential formula: ([(FwdU(Init,(p25==1)) * (p182==1))] != FALSE + ([(FwdU(FwdU(Init,(p25==1)),TRUE) * ((p185==1)&&(p250==1)))] != ...259
Hit Full ! (commute/partial/dont) 37/0/2
(forward)formula 0,1,0.028824,3924,1,0,8,1215,17,2,363,803,7
FORMULA SmartHome-PT-08-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 188
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 154 transition count 186
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 58 place count 142 transition count 174
Iterating global reduction 1 with 12 rules applied. Total rules applied 70 place count 142 transition count 174
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 134 transition count 166
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 134 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 87 place count 134 transition count 165
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 133 transition count 164
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 133 transition count 164
Applied a total of 89 rules in 12 ms. Remains 133 /176 variables (removed 43) and now considering 164/210 (removed 46) transitions.
// Phase 1: matrix 164 rows 133 cols
[2024-05-30 01:11:09] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:11:10] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-30 01:11:10] [INFO ] Invariant cache hit.
[2024-05-30 01:11:10] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-30 01:11:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 3 ms to minimize.
[2024-05-30 01:11:12] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 146 constraints, problems are : Problem set: 0 solved, 163 unsolved in 8465 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/133 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/133 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 164/297 variables, 133/146 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 163/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 163 unsolved
[2024-05-30 01:11:23] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 3 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/297 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 9 (OVERLAPS) 0/297 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 310 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11109 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 3/3 constraints]
After SMT, in 19608ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 19611ms
Starting structural reductions in LTL mode, iteration 1 : 133/176 places, 164/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19911 ms. Remains : 133/176 places, 164/210 transitions.
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 6 ms
[2024-05-30 01:11:29] [INFO ] Input system was already deterministic with 164 transitions.
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 9 ms
[2024-05-30 01:11:29] [INFO ] Flatten gal took : 8 ms
[2024-05-30 01:11:29] [INFO ] Time to serialize gal into /tmp/CTLFireability12792757475200191281.gal : 3 ms
[2024-05-30 01:11:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15364578430233062592.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/CTLFireability12792757475200191281.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15364578430233062592.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,2.99195e+09,0.494164,13288,2,2642,5,46591,6,0,698,41714,0


Converting to forward existential form...Done !
original formula: EF(AG(EX(EX((p160==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(EX((p160==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t65, t85, t105, t139, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,2.59121,63708,1,0,225,334751,349,151,4058,239986,369
FORMULA SmartHome-PT-08-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 154 transition count 188
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 154 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 154 transition count 186
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 56 place count 144 transition count 176
Iterating global reduction 1 with 10 rules applied. Total rules applied 66 place count 144 transition count 176
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 139 transition count 171
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 139 transition count 171
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 139 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 138 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 138 transition count 169
Applied a total of 79 rules in 6 ms. Remains 138 /176 variables (removed 38) and now considering 169/210 (removed 41) transitions.
// Phase 1: matrix 169 rows 138 cols
[2024-05-30 01:11:32] [INFO ] Computed 11 invariants in 3 ms
[2024-05-30 01:11:32] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 01:11:32] [INFO ] Invariant cache hit.
[2024-05-30 01:11:32] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-05-30 01:11:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 01:11:34] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-30 01:11:34] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/307 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 0/307 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 151 constraints, problems are : Problem set: 0 solved, 168 unsolved in 6121 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/138 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (OVERLAPS) 169/307 variables, 138/151 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 168/319 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-30 01:11:41] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (OVERLAPS) 0/307 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 320 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7352 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 138/138 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 3/3 constraints]
After SMT, in 13494ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 13497ms
Starting structural reductions in LTL mode, iteration 1 : 138/176 places, 169/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13701 ms. Remains : 138/176 places, 169/210 transitions.
[2024-05-30 01:11:46] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:46] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:46] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-30 01:11:46] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:46] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:11:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8106123553009166760.gal : 2 ms
[2024-05-30 01:11:46] [INFO ] Time to serialize properties into /tmp/CTLFireability8262334973474294193.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/CTLFireability8106123553009166760.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8262334973474294193.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,3.42754e+09,0.395716,12524,2,2910,5,43710,6,0,723,37240,0


Converting to forward existential form...Done !
original formula: EX((AF(((p49==1)&&(p131==1))) * EF((((p217==0)||((p188==0)&&(p117==0)))||(p229==0)))))
=> equivalent forward existential formula: [(FwdU((EY(Init) * !(EG(!(((p49==1)&&(p131==1)))))),TRUE) * (((p217==0)||((p188==0)&&(p117==0)))||(p229==0)))] !...162
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t35, t67, t89, t110, t144, Intersection with reachable at each step enabled. (...202
(forward)formula 0,0,10.075,237724,1,0,594,1.47472e+06,362,341,4085,1.36003e+06,763
FORMULA SmartHome-PT-08-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 210/210 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 158 transition count 192
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 158 transition count 192
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 158 transition count 190
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 150 transition count 182
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 150 transition count 182
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 145 transition count 177
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 145 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 145 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 144 transition count 175
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 144 transition count 175
Applied a total of 67 rules in 6 ms. Remains 144 /176 variables (removed 32) and now considering 175/210 (removed 35) transitions.
// Phase 1: matrix 175 rows 144 cols
[2024-05-30 01:11:56] [INFO ] Computed 11 invariants in 2 ms
[2024-05-30 01:11:56] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-30 01:11:56] [INFO ] Invariant cache hit.
[2024-05-30 01:11:56] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-30 01:11:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 01:11:58] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 2 ms to minimize.
[2024-05-30 01:11:59] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 175/319 variables, 144/163 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 163 constraints, problems are : Problem set: 0 solved, 174 unsolved in 7956 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/143 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/144 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-30 01:12:05] [INFO ] Deduced a trap composed of 94 places in 86 ms of which 2 ms to minimize.
[2024-05-30 01:12:05] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 175/319 variables, 144/165 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 174/339 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/319 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 339 constraints, problems are : Problem set: 0 solved, 174 unsolved in 8773 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 144/144 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 10/10 constraints]
After SMT, in 16753ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 16755ms
Starting structural reductions in LTL mode, iteration 1 : 144/176 places, 175/210 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17030 ms. Remains : 144/176 places, 175/210 transitions.
[2024-05-30 01:12:13] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:12:13] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:12:13] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-30 01:12:13] [INFO ] Flatten gal took : 5 ms
[2024-05-30 01:12:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 01:12:13] [INFO ] Time to serialize gal into /tmp/CTLFireability13518143397818967875.gal : 2 ms
[2024-05-30 01:12:13] [INFO ] Time to serialize properties into /tmp/CTLFireability12629583969364846447.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/CTLFireability13518143397818967875.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12629583969364846447.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,5.36962e+09,0.430572,11504,2,2822,5,37418,6,0,753,32562,0


Converting to forward existential form...Done !
original formula: AG((AF(EX((((p64==1)||(p96==1)) * AX((p64==1))))) + (((p33==1) * EX((p116==0))) * EX(EX(EG((p110==1)))))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !((((p33==1) * EX((p116==0))) * EX(EX(EG((p110==1))))))),!(EX((((p64==1)||(p96==1)) * !...185
Reverse transition relation is NOT exact ! Due to transitions t9, t10, t12, t32, t64, t89, t111, t113, t128, t150, Intersection with reachable at each ste...215
(forward)formula 0,0,2.86785,63584,1,0,268,310804,379,174,4463,272769,421
FORMULA SmartHome-PT-08-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-30 01:12:16] [INFO ] Flatten gal took : 11 ms
[2024-05-30 01:12:16] [INFO ] Flatten gal took : 8 ms
Total runtime 234551 ms.

BK_STOP 1717031536503

--------------------
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-08"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SmartHome-PT-08, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r378-smll-171683811400394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-08.tgz
mv SmartHome-PT-08 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;