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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 12 03:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 03:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 03:41 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 181K 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-19-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-19-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-19-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717037493006

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-19
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 02:51:35] [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 02:51:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:51:35] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2024-05-30 02:51:35] [INFO ] Transformed 741 places.
[2024-05-30 02:51:35] [INFO ] Transformed 809 transitions.
[2024-05-30 02:51:35] [INFO ] Found NUPN structural information;
[2024-05-30 02:51:36] [INFO ] Parsed PT model containing 741 places and 809 transitions and 1844 arcs in 501 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Deduced a syphon composed of 227 places in 17 ms
Reduce places removed 227 places and 198 transitions.
FORMULA SmartHome-PT-19-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 611/611 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 495 transition count 611
Discarding 123 places :
Symmetric choice reduction at 1 with 123 rule applications. Total rules 142 place count 372 transition count 488
Iterating global reduction 1 with 123 rules applied. Total rules applied 265 place count 372 transition count 488
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 275 place count 372 transition count 478
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 299 place count 348 transition count 454
Iterating global reduction 2 with 24 rules applied. Total rules applied 323 place count 348 transition count 454
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 345 place count 326 transition count 432
Iterating global reduction 2 with 22 rules applied. Total rules applied 367 place count 326 transition count 432
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 370 place count 326 transition count 429
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 374 place count 322 transition count 425
Iterating global reduction 3 with 4 rules applied. Total rules applied 378 place count 322 transition count 425
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 380 place count 320 transition count 423
Iterating global reduction 3 with 2 rules applied. Total rules applied 382 place count 320 transition count 423
Applied a total of 382 rules in 361 ms. Remains 320 /514 variables (removed 194) and now considering 423/611 (removed 188) transitions.
// Phase 1: matrix 423 rows 320 cols
[2024-05-30 02:51:36] [INFO ] Computed 3 invariants in 52 ms
[2024-05-30 02:51:37] [INFO ] Implicit Places using invariants in 546 ms returned []
[2024-05-30 02:51:37] [INFO ] Invariant cache hit.
[2024-05-30 02:51:37] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
Running 422 sub problems to find dead transitions.
[2024-05-30 02:51:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/743 variables, 320/323 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/743 variables, and 323 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30086 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 422 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/319 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/319 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 2 (OVERLAPS) 1/320 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/320 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 4 (OVERLAPS) 423/743 variables, 320/323 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/743 variables, 422/745 constraints. Problems are: Problem set: 0 solved, 422 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/743 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 422 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/743 variables, and 745 constraints, problems are : Problem set: 0 solved, 422 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 422/422 constraints, Known Traps: 0/0 constraints]
After SMT, in 60446ms problems are : Problem set: 0 solved, 422 unsolved
Search for dead transitions found 0 dead transitions in 60500ms
Starting structural reductions in LTL mode, iteration 1 : 320/514 places, 423/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62052 ms. Remains : 320/514 places, 423/611 transitions.
Support contains 65 out of 320 places after structural reductions.
[2024-05-30 02:52:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 02:52:38] [INFO ] Flatten gal took : 133 ms
[2024-05-30 02:52:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmartHome-PT-19-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-19-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:52:38] [INFO ] Flatten gal took : 56 ms
[2024-05-30 02:52:38] [INFO ] Input system was already deterministic with 423 transitions.
Support contains 57 out of 320 places (down from 65) after GAL structural reductions.
RANDOM walk for 40000 steps (108 resets) in 2636 ms. (15 steps per ms) remains 5/50 properties
BEST_FIRST walk for 40004 steps (12 resets) in 135 ms. (294 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 114 ms. (347 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (12 resets) in 79 ms. (500 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 103 ms. (384 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2024-05-30 02:52:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/17 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/56 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 73/129 variables, 24/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/129 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/132 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 5/137 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 160/297 variables, 52/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 153/450 variables, 71/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/450 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 1/451 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/451 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 130/581 variables, 65/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/581 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 87/668 variables, 44/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/668 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 45/713 variables, 25/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/713 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp15 is UNSAT
At refinement iteration 25 (OVERLAPS) 16/729 variables, 11/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/729 variables, 0/316 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/733 variables, 2/318 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/733 variables, 0/318 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 5/738 variables, 2/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/738 variables, 0/320 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 4/742 variables, 2/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/742 variables, 0/322 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 1/743 variables, 1/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/743 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/743 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 743/743 variables, and 323 constraints, problems are : Problem set: 1 solved, 1 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/10 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/33 variables, 7/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 48/81 variables, 14/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/84 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/84 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/89 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 150/239 variables, 44/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/239 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 156/395 variables, 71/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/395 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/396 variables, 1/144 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/396 variables, 1/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 144/540 variables, 70/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 0/215 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 102/642 variables, 52/267 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/642 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 53/695 variables, 31/298 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/695 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 19/714 variables, 13/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/714 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/718 variables, 2/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/718 variables, 0/313 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 5/723 variables, 1/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/723 variables, 0/314 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/729 variables, 3/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/729 variables, 0/317 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 4/733 variables, 2/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/733 variables, 0/319 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 5/738 variables, 2/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/738 variables, 0/321 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 4/742 variables, 2/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/742 variables, 0/323 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 1/743 variables, 1/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/743 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/743 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 743/743 variables, and 324 constraints, problems are : Problem set: 1 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1227ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=39 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2024-05-30 02:52:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 02:52:41] [INFO ] Flatten gal took : 25 ms
FORMULA SmartHome-PT-19-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:52:41] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:52:41] [INFO ] Input system was already deterministic with 423 transitions.
Computed a total of 61 stabilizing places and 60 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 339 edges and 320 vertex of which 179 / 320 are part of one of the 15 SCC in 5 ms
Free SCC test removed 164 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 155 transition count 149
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 61 rules applied. Total rules applied 116 place count 101 transition count 142
Reduce places removed 4 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 6 rules applied. Total rules applied 122 place count 97 transition count 140
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 124 place count 96 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 95 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 125 place count 95 transition count 134
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 135 place count 90 transition count 134
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 153 place count 72 transition count 111
Iterating global reduction 5 with 18 rules applied. Total rules applied 171 place count 72 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 174 place count 72 transition count 108
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 177 place count 69 transition count 105
Iterating global reduction 6 with 3 rules applied. Total rules applied 180 place count 69 transition count 105
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 250 place count 34 transition count 69
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 254 place count 34 transition count 65
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 256 place count 33 transition count 64
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 259 place count 30 transition count 52
Iterating global reduction 8 with 3 rules applied. Total rules applied 262 place count 30 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 266 place count 28 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 8 with 8 rules applied. Total rules applied 274 place count 28 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 275 place count 27 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 275 place count 27 transition count 41
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 277 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 278 place count 25 transition count 39
Iterating global reduction 9 with 1 rules applied. Total rules applied 279 place count 25 transition count 39
Applied a total of 279 rules in 86 ms. Remains 25 /320 variables (removed 295) and now considering 39/423 (removed 384) transitions.
[2024-05-30 02:52:41] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-30 02:52:41] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:52:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:52:41] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2024-05-30 02:52:41] [INFO ] Invariant cache hit.
[2024-05-30 02:52:41] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-30 02:52:41] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2024-05-30 02:52:41] [INFO ] Redundant transitions in 50 ms returned []
Running 38 sub problems to find dead transitions.
[2024-05-30 02:52:41] [INFO ] Flow matrix only has 27 transitions (discarded 12 similar events)
[2024-05-30 02:52:41] [INFO ] Invariant cache hit.
[2024-05-30 02:52:41] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 26/51 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 1/52 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 40 constraints, problems are : Problem set: 0 solved, 38 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 26/51 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 38/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 1/52 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 78 constraints, problems are : Problem set: 0 solved, 38 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints]
After SMT, in 1455ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1457ms
Starting structural reductions in SI_CTL mode, iteration 1 : 25/320 places, 39/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1713 ms. Remains : 25/320 places, 39/423 transitions.
[2024-05-30 02:52:43] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:52:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:52:43] [INFO ] Input system was already deterministic with 39 transitions.
[2024-05-30 02:52:43] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:52:43] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:52:43] [INFO ] Time to serialize gal into /tmp/CTLFireability3670968695977896469.gal : 3 ms
[2024-05-30 02:52:43] [INFO ] Time to serialize properties into /tmp/CTLFireability264721120496910324.ctl : 7 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/CTLFireability3670968695977896469.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability264721120496910324.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,794881,0.028474,3424,2,69,5,459,6,0,123,437,0


Converting to forward existential form...Done !
original formula: AF(((p2==1)&&(p99==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p2==1)&&(p99==1))))] = FALSE
Hit Full ! (commute/partial/dont) 27/0/12
(forward)formula 0,0,0.048133,3772,1,0,10,2361,20,4,677,2464,9
FORMULA SmartHome-PT-19-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 293 transition count 396
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 293 transition count 396
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 57 place count 293 transition count 393
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 67 place count 283 transition count 383
Iterating global reduction 1 with 10 rules applied. Total rules applied 77 place count 283 transition count 383
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 277 transition count 377
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 277 transition count 377
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 274 transition count 374
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 274 transition count 374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 96 place count 273 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 97 place count 273 transition count 373
Applied a total of 97 rules in 36 ms. Remains 273 /320 variables (removed 47) and now considering 373/423 (removed 50) transitions.
// Phase 1: matrix 373 rows 273 cols
[2024-05-30 02:52:43] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:52:43] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-05-30 02:52:43] [INFO ] Invariant cache hit.
[2024-05-30 02:52:43] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 372 sub problems to find dead transitions.
[2024-05-30 02:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (OVERLAPS) 0/646 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Real declared 646/646 variables, and 276 constraints, problems are : Problem set: 0 solved, 372 unsolved in 24402 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 372 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 2 (OVERLAPS) 1/273 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/273 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 4 (OVERLAPS) 373/646 variables, 273/276 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/646 variables, 372/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
At refinement iteration 7 (OVERLAPS) 0/646 variables, 0/648 constraints. Problems are: Problem set: 0 solved, 372 unsolved
No progress, stopping.
After SMT solving in domain Int declared 646/646 variables, and 648 constraints, problems are : Problem set: 0 solved, 372 unsolved in 24393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 273/273 constraints, PredecessorRefiner: 372/372 constraints, Known Traps: 0/0 constraints]
After SMT, in 48893ms problems are : Problem set: 0 solved, 372 unsolved
Search for dead transitions found 0 dead transitions in 48902ms
Starting structural reductions in LTL mode, iteration 1 : 273/320 places, 373/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49382 ms. Remains : 273/320 places, 373/423 transitions.
[2024-05-30 02:53:32] [INFO ] Flatten gal took : 31 ms
[2024-05-30 02:53:32] [INFO ] Flatten gal took : 27 ms
[2024-05-30 02:53:32] [INFO ] Input system was already deterministic with 373 transitions.
[2024-05-30 02:53:32] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:53:32] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:53:32] [INFO ] Time to serialize gal into /tmp/CTLFireability3678756610155397138.gal : 14 ms
[2024-05-30 02:53:32] [INFO ] Time to serialize properties into /tmp/CTLFireability17235547905677555409.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/CTLFireability3678756610155397138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17235547905677555409.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74709e+21,2.23122,53948,2,8105,5,248080,6,0,1451,236378,0


Converting to forward existential form...Done !
original formula: EF(AG((EX((p588!=1)) * (p433==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX((p588!=1)) * (p433==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t11, t29, t32, t61, t93, t96, t113, t116, t133, t136, t148, t151, t168, t183, t203, t218,...316
Detected timeout of ITS tools.
[2024-05-30 02:54:02] [INFO ] Flatten gal took : 22 ms
[2024-05-30 02:54:02] [INFO ] Applying decomposition
[2024-05-30 02:54:02] [INFO ] Flatten gal took : 23 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/graph6555722842340198269.txt' '-o' '/tmp/graph6555722842340198269.bin' '-w' '/tmp/graph6555722842340198269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6555722842340198269.bin' '-l' '-1' '-v' '-w' '/tmp/graph6555722842340198269.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:54:03] [INFO ] Decomposing Gal with order
[2024-05-30 02:54:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:54:03] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-30 02:54:03] [INFO ] Flatten gal took : 110 ms
[2024-05-30 02:54:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2024-05-30 02:54:03] [INFO ] Time to serialize gal into /tmp/CTLFireability10326643306858303318.gal : 10 ms
[2024-05-30 02:54:03] [INFO ] Time to serialize properties into /tmp/CTLFireability15715769262652083057.ctl : 6 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/CTLFireability10326643306858303318.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15715769262652083057.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.74709e+21,0.224027,9480,487,44,11207,771,545,18122,58,2366,0


Converting to forward existential form...Done !
original formula: EF(AG((EX((i12.i1.u101.p588!=1)) * (i13.u71.p433==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((EX((i12.i1.u101.p588!=1)) * (i13.u71.p433==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t32, t96, t116, t136, t151, i1.i0.u18.t334, i2.i1.u19.t303, i3.u26.t288, i4.u32.t273, i5.u36....507
(forward)formula 0,0,0.790281,26640,1,0,42028,771,3678,88738,286,2366,95043
FORMULA SmartHome-PT-19-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 344 edges and 320 vertex of which 198 / 320 are part of one of the 16 SCC in 1 ms
Free SCC test removed 182 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 137 transition count 135
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 92 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 90 transition count 131
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 97 place count 90 transition count 127
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 86 transition count 127
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 121 place count 70 transition count 106
Iterating global reduction 3 with 16 rules applied. Total rules applied 137 place count 70 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 138 place count 70 transition count 105
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 141 place count 67 transition count 102
Iterating global reduction 4 with 3 rules applied. Total rules applied 144 place count 67 transition count 102
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 212 place count 33 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 213 place count 33 transition count 66
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 217 place count 29 transition count 50
Iterating global reduction 5 with 4 rules applied. Total rules applied 221 place count 29 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 28 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 236 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 27 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 237 place count 27 transition count 35
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 241 place count 24 transition count 31
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 244 place count 23 transition count 30
Applied a total of 244 rules in 39 ms. Remains 23 /320 variables (removed 297) and now considering 30/423 (removed 393) transitions.
[2024-05-30 02:54:04] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 23 cols
[2024-05-30 02:54:04] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:54:04] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-30 02:54:04] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-30 02:54:04] [INFO ] Invariant cache hit.
[2024-05-30 02:54:04] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2024-05-30 02:54:04] [INFO ] Redundant transitions in 35 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:54:04] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-30 02:54:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/41 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1/42 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/42 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/47 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 21/41 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/43 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 1/44 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/44 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/47 variables, and 37 constraints, problems are : Problem set: 0 solved, 13 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/23 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 512ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/320 places, 30/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 788 ms. Remains : 23/320 places, 30/423 transitions.
[2024-05-30 02:54:05] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:54:05] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:54:05] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-30 02:54:05] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:05] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:54:05] [INFO ] Time to serialize gal into /tmp/CTLFireability10416003173691942357.gal : 1 ms
[2024-05-30 02:54:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3735376053932617947.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/CTLFireability10416003173691942357.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3735376053932617947.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,194304,0.00612,3492,2,62,5,361,6,0,104,350,0


Converting to forward existential form...Done !
original formula: AF(EG(EF(((p430==1)&&(p40==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(E(TRUE U ((p430==1)&&(p40==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t18, t19, t21, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.020952,4076,1,0,61,3582,86,31,661,3084,69
FORMULA SmartHome-PT-19-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 295 transition count 398
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 295 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 295 transition count 395
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 287 transition count 387
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 287 transition count 387
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 283 transition count 383
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 283 transition count 383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 79 place count 281 transition count 381
Iterating global reduction 1 with 2 rules applied. Total rules applied 81 place count 281 transition count 381
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 82 place count 280 transition count 380
Iterating global reduction 1 with 1 rules applied. Total rules applied 83 place count 280 transition count 380
Applied a total of 83 rules in 26 ms. Remains 280 /320 variables (removed 40) and now considering 380/423 (removed 43) transitions.
// Phase 1: matrix 380 rows 280 cols
[2024-05-30 02:54:05] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:54:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 02:54:05] [INFO ] Invariant cache hit.
[2024-05-30 02:54:05] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-05-30 02:54:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/660 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (OVERLAPS) 0/660 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 283 constraints, problems are : Problem set: 0 solved, 379 unsolved in 28545 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/660 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 379/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 0/660 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 662 constraints, problems are : Problem set: 0 solved, 379 unsolved in 26870 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 55485ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 55491ms
Starting structural reductions in LTL mode, iteration 1 : 280/320 places, 380/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55856 ms. Remains : 280/320 places, 380/423 transitions.
[2024-05-30 02:55:01] [INFO ] Flatten gal took : 22 ms
[2024-05-30 02:55:01] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:55:01] [INFO ] Input system was already deterministic with 380 transitions.
[2024-05-30 02:55:01] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:55:01] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:55:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14138933467002297967.gal : 4 ms
[2024-05-30 02:55:01] [INFO ] Time to serialize properties into /tmp/CTLFireability11679845695066703975.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/CTLFireability14138933467002297967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11679845695066703975.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,4.70183e+21,3.37846,74208,2,9634,5,351826,6,0,1486,331613,0


Converting to forward existential form...Done !
original formula: AG((AX(((p244==1) + EF((p513==1)))) * (((EF((p402==0)) + EG(((EF(((p2==1)&&(p255==1))) + (p318==1)) + (p164==1)))) + ((p548==0)||(p217!=1...223
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !((p244==1))) * !(E(TRUE U (p513==1))))] = FALSE * ([(FwdU((FwdU(Init,TRUE) * !(((E(TR...542
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t205, t220,...316
Detected timeout of ITS tools.
[2024-05-30 02:55:31] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:55:31] [INFO ] Applying decomposition
[2024-05-30 02:55:31] [INFO ] Flatten gal took : 12 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/graph9493168817003545189.txt' '-o' '/tmp/graph9493168817003545189.bin' '-w' '/tmp/graph9493168817003545189.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9493168817003545189.bin' '-l' '-1' '-v' '-w' '/tmp/graph9493168817003545189.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:55:31] [INFO ] Decomposing Gal with order
[2024-05-30 02:55:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:55:31] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-30 02:55:31] [INFO ] Flatten gal took : 64 ms
[2024-05-30 02:55:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-30 02:55:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4092642172480267977.gal : 9 ms
[2024-05-30 02:55:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6659680943184094519.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/CTLFireability4092642172480267977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6659680943184094519.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.70183e+21,0.270651,8692,510,43,9095,590,568,14835,69,1660,0


Converting to forward existential form...Done !
original formula: AG((AX(((i7.u38.p244==1) + EF((i15.u86.p513==1)))) * (((EF((i12.u66.p402==0)) + EG(((EF(((i0.u1.p2==1)&&(i7.u41.p255==1))) + (i9.u52.p318...322
=> equivalent forward existential formula: ([((EY(FwdU(Init,TRUE)) * !((i7.u38.p244==1))) * !(E(TRUE U (i15.u86.p513==1))))] = FALSE * ([(FwdU((FwdU(Init,T...711
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u1.t344, i0.u106.t8, i0.u104.t27, i2.u10.t341, i3.u20.t31...482
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,0.885792,27436,1,0,46782,590,4336,87553,368,1792,113509
FORMULA SmartHome-PT-19-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 292 transition count 395
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 292 transition count 395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 59 place count 292 transition count 392
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 70 place count 281 transition count 381
Iterating global reduction 1 with 11 rules applied. Total rules applied 81 place count 281 transition count 381
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 275 transition count 375
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 275 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 96 place count 272 transition count 372
Iterating global reduction 1 with 3 rules applied. Total rules applied 99 place count 272 transition count 372
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 271 transition count 371
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 271 transition count 371
Applied a total of 101 rules in 21 ms. Remains 271 /320 variables (removed 49) and now considering 371/423 (removed 52) transitions.
// Phase 1: matrix 371 rows 271 cols
[2024-05-30 02:55:32] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:55:32] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 02:55:32] [INFO ] Invariant cache hit.
[2024-05-30 02:55:32] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2024-05-30 02:55:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (OVERLAPS) 0/642 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 274 constraints, problems are : Problem set: 0 solved, 370 unsolved in 22464 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 370 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/271 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (OVERLAPS) 371/642 variables, 271/274 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/642 variables, 370/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 7 (OVERLAPS) 0/642 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 370 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 644 constraints, problems are : Problem set: 0 solved, 370 unsolved in 24697 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 370/370 constraints, Known Traps: 0/0 constraints]
After SMT, in 47215ms problems are : Problem set: 0 solved, 370 unsolved
Search for dead transitions found 0 dead transitions in 47219ms
Starting structural reductions in LTL mode, iteration 1 : 271/320 places, 371/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47537 ms. Remains : 271/320 places, 371/423 transitions.
[2024-05-30 02:56:20] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:56:20] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:56:20] [INFO ] Input system was already deterministic with 371 transitions.
[2024-05-30 02:56:20] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:56:20] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:56:20] [INFO ] Time to serialize gal into /tmp/CTLFireability1713052813026348406.gal : 5 ms
[2024-05-30 02:56:20] [INFO ] Time to serialize properties into /tmp/CTLFireability9678555239037331547.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/CTLFireability1713052813026348406.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9678555239037331547.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.57362e+21,2.0642,58328,2,8184,5,262962,6,0,1441,252928,0


Converting to forward existential form...Done !
original formula: A((p502!=1) U AF(!(EF(AX((p455==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(EX(!((p455==1))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(EX(!((p455==1)))))))...236
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...316
Detected timeout of ITS tools.
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:56:50] [INFO ] Applying decomposition
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 8 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/graph4557792986068699780.txt' '-o' '/tmp/graph4557792986068699780.bin' '-w' '/tmp/graph4557792986068699780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4557792986068699780.bin' '-l' '-1' '-v' '-w' '/tmp/graph4557792986068699780.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:56:50] [INFO ] Decomposing Gal with order
[2024-05-30 02:56:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:56:50] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-30 02:56:50] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:56:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 02:56:50] [INFO ] Time to serialize gal into /tmp/CTLFireability2747235970342007790.gal : 4 ms
[2024-05-30 02:56:50] [INFO ] Time to serialize properties into /tmp/CTLFireability10063081427991575996.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/CTLFireability2747235970342007790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10063081427991575996.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,2.57362e+21,0.16054,8624,477,40,9594,533,498,14962,48,1535,0


Converting to forward existential form...Done !
original formula: A((i15.i0.u86.p502!=1) U AF(!(EF(AX((i14.u77.p455==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(!(E(TRUE U !(EX(!((i14.u77.p455==1))))))))))))) * !(E(!(!(EG(!(!(E(TRUE U !(EX(!((i14.u7...271
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t114, t134, t149, i0.u1.t335, i0.u106.t8, i1.i0.u9.t332, i2.u23.t301, i4.u27.t...482
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 a local SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,0,0.652347,25256,1,0,41425,533,3624,80427,255,1535,108237
FORMULA SmartHome-PT-19-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 326 edges and 320 vertex of which 138 / 320 are part of one of the 15 SCC in 1 ms
Free SCC test removed 123 places
Ensure Unique test removed 165 transitions
Reduce isomorphic transitions removed 165 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 196 transition count 191
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 79 rules applied. Total rules applied 146 place count 130 transition count 178
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 12 rules applied. Total rules applied 158 place count 122 transition count 174
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 3 with 9 rules applied. Total rules applied 167 place count 120 transition count 167
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 174 place count 113 transition count 167
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 174 place count 113 transition count 159
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 190 place count 105 transition count 159
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 204 place count 91 transition count 144
Iterating global reduction 5 with 14 rules applied. Total rules applied 218 place count 91 transition count 144
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 222 place count 91 transition count 140
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 224 place count 90 transition count 139
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 225 place count 89 transition count 138
Iterating global reduction 7 with 1 rules applied. Total rules applied 226 place count 89 transition count 138
Performed 40 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 306 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 313 place count 49 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 314 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 317 place count 45 transition count 76
Iterating global reduction 9 with 3 rules applied. Total rules applied 320 place count 45 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 328 place count 41 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 338 place count 41 transition count 62
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 339 place count 40 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 339 place count 40 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 341 place count 39 transition count 61
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 342 place count 38 transition count 59
Iterating global reduction 10 with 1 rules applied. Total rules applied 343 place count 38 transition count 59
Applied a total of 343 rules in 54 ms. Remains 38 /320 variables (removed 282) and now considering 59/423 (removed 364) transitions.
[2024-05-30 02:56:51] [INFO ] Flow matrix only has 45 transitions (discarded 14 similar events)
// Phase 1: matrix 45 rows 38 cols
[2024-05-30 02:56:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-30 02:56:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 02:56:51] [INFO ] Flow matrix only has 45 transitions (discarded 14 similar events)
[2024-05-30 02:56:51] [INFO ] Invariant cache hit.
[2024-05-30 02:56:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 02:56:51] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-30 02:56:51] [INFO ] Redundant transitions in 31 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-30 02:56:51] [INFO ] Flow matrix only has 45 transitions (discarded 14 similar events)
[2024-05-30 02:56:51] [INFO ] Invariant cache hit.
[2024-05-30 02:56:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/83 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/83 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/83 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/83 variables, and 48 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/38 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 44/82 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 58/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/83 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/83 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/83 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/83 variables, and 106 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 38/38 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 2560ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2563ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/320 places, 59/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2776 ms. Remains : 38/320 places, 59/423 transitions.
[2024-05-30 02:56:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:56:53] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:56:53] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-30 02:56:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:56:53] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8478795441873997453.gal : 1 ms
[2024-05-30 02:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability17525262940272381977.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/CTLFireability8478795441873997453.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17525262940272381977.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.32268e+08,0.018846,3684,2,127,5,777,6,0,192,759,0


Converting to forward existential form...Done !
original formula: AG((EG((p338==0)) + (!(A((((p2==1)&&(p567==1))&&(p153==1)) U (p83!=1))) * (EF((p434==0)) + ((p464==1)&&((p567==0)||(p319==0)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((!(!((E(!((p83!=1)) U (!((((p2==1)&&(p567==1))&&(p153==1))) * !((p83!=1)))) + EG(!((p83!=...256
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t6, t10, t12, t14, t19, t21, t24, t26, t30, t33, t34, t36, t38, t51, Intersection wi...237
(forward)formula 0,0,0.401187,11924,1,0,315,51084,147,168,1249,69243,338
FORMULA SmartHome-PT-19-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 342 edges and 320 vertex of which 193 / 320 are part of one of the 16 SCC in 1 ms
Free SCC test removed 177 places
Ensure Unique test removed 234 transitions
Reduce isomorphic transitions removed 234 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 142 transition count 142
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 96 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 94 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 99 place count 94 transition count 133
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 109 place count 89 transition count 133
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 126 place count 72 transition count 111
Iterating global reduction 3 with 17 rules applied. Total rules applied 143 place count 72 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 72 transition count 109
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 148 place count 69 transition count 106
Iterating global reduction 4 with 3 rules applied. Total rules applied 151 place count 69 transition count 106
Performed 35 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 221 place count 34 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 223 place count 34 transition count 67
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 225 place count 32 transition count 59
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 32 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 231 place count 30 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 248 place count 30 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 250 place count 28 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 250 place count 28 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 252 place count 27 transition count 39
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 254 place count 25 transition count 35
Iterating global reduction 6 with 2 rules applied. Total rules applied 256 place count 25 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 24 transition count 34
Applied a total of 257 rules in 25 ms. Remains 24 /320 variables (removed 296) and now considering 34/423 (removed 389) transitions.
[2024-05-30 02:56:54] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
// Phase 1: matrix 26 rows 24 cols
[2024-05-30 02:56:54] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:56:54] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-30 02:56:54] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-30 02:56:54] [INFO ] Invariant cache hit.
[2024-05-30 02:56:54] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-30 02:56:54] [INFO ] Redundant transitions in 21 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:56:54] [INFO ] Flow matrix only has 26 transitions (discarded 8 similar events)
[2024-05-30 02:56:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/45 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/45 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/50 variables, and 23 constraints, problems are : Problem set: 0 solved, 13 unsolved in 183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 21/40 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 5/45 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/46 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 1/47 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 0/47 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/50 variables, and 37 constraints, problems are : Problem set: 0 solved, 13 unsolved in 279 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 23/24 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 466ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 468ms
Starting structural reductions in SI_CTL mode, iteration 1 : 24/320 places, 34/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 600 ms. Remains : 24/320 places, 34/423 transitions.
[2024-05-30 02:56:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:56:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:56:54] [INFO ] Input system was already deterministic with 34 transitions.
[2024-05-30 02:56:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:56:54] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:56:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12520813558647131646.gal : 0 ms
[2024-05-30 02:56:54] [INFO ] Time to serialize properties into /tmp/CTLFireability10289631334352322862.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/CTLFireability12520813558647131646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10289631334352322862.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,476928,0.005777,3516,2,68,5,376,6,0,107,358,0


Converting to forward existential form...Done !
original formula: EF(((p73==1) + AF(AG((p500==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p73==1))] != FALSE + [(FwdU(Init,TRUE) * !(EG(!(!(E(TRUE U !((p500==1))))))))] != FALSE)
(forward)formula 0,1,0.006352,3836,1,0,7,376,8,1,110,358,1
FORMULA SmartHome-PT-19-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 295 transition count 398
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 295 transition count 398
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 53 place count 295 transition count 395
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 62 place count 286 transition count 386
Iterating global reduction 1 with 9 rules applied. Total rules applied 71 place count 286 transition count 386
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 75 place count 282 transition count 382
Iterating global reduction 1 with 4 rules applied. Total rules applied 79 place count 282 transition count 382
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 81 place count 280 transition count 380
Iterating global reduction 1 with 2 rules applied. Total rules applied 83 place count 280 transition count 380
Applied a total of 83 rules in 16 ms. Remains 280 /320 variables (removed 40) and now considering 380/423 (removed 43) transitions.
// Phase 1: matrix 380 rows 280 cols
[2024-05-30 02:56:54] [INFO ] Computed 3 invariants in 8 ms
[2024-05-30 02:56:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-30 02:56:55] [INFO ] Invariant cache hit.
[2024-05-30 02:56:55] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2024-05-30 02:56:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/660 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (OVERLAPS) 0/660 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 283 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (OVERLAPS) 380/660 variables, 280/283 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/660 variables, 379/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/660 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 0/660 variables, 0/662 constraints. Problems are: Problem set: 0 solved, 379 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 662 constraints, problems are : Problem set: 0 solved, 379 unsolved in 26800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 0/0 constraints]
After SMT, in 56899ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 56906ms
Starting structural reductions in LTL mode, iteration 1 : 280/320 places, 380/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57378 ms. Remains : 280/320 places, 380/423 transitions.
[2024-05-30 02:57:52] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:57:52] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:57:52] [INFO ] Input system was already deterministic with 380 transitions.
[2024-05-30 02:57:52] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:57:52] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:57:52] [INFO ] Time to serialize gal into /tmp/CTLFireability5596615557068606815.gal : 2 ms
[2024-05-30 02:57:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16445797706539119225.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/CTLFireability5596615557068606815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16445797706539119225.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.69349e+21,2.59063,56044,2,8504,5,257286,6,0,1486,244280,0


Converting to forward existential form...Done !
original formula: (EX((((p543==1)||(p513==1))&&(p233==1))) + EF(((p371==1) * EF((p378==1)))))
=> equivalent forward existential formula: ([(EY(Init) * (((p543==1)||(p513==1))&&(p233==1)))] != FALSE + [(FwdU((FwdU(Init,TRUE) * (p371==1)),TRUE) * (p37...172
(forward)formula 0,1,2.87162,56044,1,0,12,257286,11,3,2845,244280,6
FORMULA SmartHome-PT-19-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 298 transition count 401
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 298 transition count 401
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 298 transition count 399
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 287 transition count 388
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 287 transition count 388
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 281 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 281 transition count 382
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 278 transition count 379
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 278 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 277 transition count 378
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 277 transition count 378
Applied a total of 88 rules in 19 ms. Remains 277 /320 variables (removed 43) and now considering 378/423 (removed 45) transitions.
// Phase 1: matrix 378 rows 277 cols
[2024-05-30 02:57:55] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:57:55] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 02:57:55] [INFO ] Invariant cache hit.
[2024-05-30 02:57:55] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-30 02:57:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 280 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 377/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 0/655 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 657 constraints, problems are : Problem set: 0 solved, 377 unsolved in 25004 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
After SMT, in 55089ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 55094ms
Starting structural reductions in LTL mode, iteration 1 : 277/320 places, 378/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55515 ms. Remains : 277/320 places, 378/423 transitions.
[2024-05-30 02:58:50] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:58:50] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:58:50] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-30 02:58:50] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:58:50] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:58:50] [INFO ] Time to serialize gal into /tmp/CTLFireability15482346255945056120.gal : 3 ms
[2024-05-30 02:58:50] [INFO ] Time to serialize properties into /tmp/CTLFireability11367242773537052761.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/CTLFireability15482346255945056120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11367242773537052761.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,4.78925e+21,2.75739,65472,2,8778,5,298688,6,0,1472,291450,0


Converting to forward existential form...Done !
original formula: E((E(EF((p71==1)) U (((p340!=1) * E(((p2==1)&&(p472==1)) U (p286==1))) * E((p458==1) U (p308==1)))) + (p383!=1)) U (EX((p98==1)) + A((p60...190
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(E(TRUE U (p71==1)) U (((p340!=1) * E(((p2==1)&&(p472==1)) U (p286==1))) * E((p458==1) U (p308...465
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t9, t11, t28, t31, t61, t93, t96, t114, t117, t134, t138, t150, t153, t170, t185, t20...336
Detected timeout of ITS tools.
[2024-05-30 02:59:20] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:59:20] [INFO ] Applying decomposition
[2024-05-30 02:59:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9899495713779228899.txt' '-o' '/tmp/graph9899495713779228899.bin' '-w' '/tmp/graph9899495713779228899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9899495713779228899.bin' '-l' '-1' '-v' '-w' '/tmp/graph9899495713779228899.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:59:21] [INFO ] Decomposing Gal with order
[2024-05-30 02:59:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:59:21] [INFO ] Removed a total of 91 redundant transitions.
[2024-05-30 02:59:21] [INFO ] Flatten gal took : 38 ms
[2024-05-30 02:59:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 18 ms.
[2024-05-30 02:59:21] [INFO ] Time to serialize gal into /tmp/CTLFireability13883851878896842747.gal : 8 ms
[2024-05-30 02:59:21] [INFO ] Time to serialize properties into /tmp/CTLFireability13082893116588360542.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/CTLFireability13883851878896842747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13082893116588360542.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.78925e+21,0.355051,10108,497,63,12176,1023,569,20054,86,2569,0


Converting to forward existential form...Done !
original formula: E((E(EF((i3.i2.u12.p71==1)) U (((i9.i0.u54.p340!=1) * E(((i16.i0.u1.p2==1)&&(i13.u76.p472==1)) U (i1.u45.p286==1))) * E((i13.u73.p458==1)...301
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(E(TRUE U (i3.i2.u12.p71==1)) U (((i9.i0.u54.p340!=1) * E(((i16.i0.u1.p2==1)&&(i13.u76.p472==1...688
Reverse transition relation is NOT exact ! Due to transitions t3, t11, t31, t96, t117, t153, t223, i1.u45.t220, i2.u31.t275, i3.i0.u10.t309, i3.i0.u10.t338...547
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 300 transition count 403
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 300 transition count 403
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 300 transition count 400
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 51 place count 292 transition count 392
Iterating global reduction 1 with 8 rules applied. Total rules applied 59 place count 292 transition count 392
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 289 transition count 389
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 289 transition count 389
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 288 transition count 388
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 288 transition count 388
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 287 transition count 387
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 287 transition count 387
Applied a total of 69 rules in 34 ms. Remains 287 /320 variables (removed 33) and now considering 387/423 (removed 36) transitions.
// Phase 1: matrix 387 rows 287 cols
[2024-05-30 02:59:51] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:59:51] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-30 02:59:51] [INFO ] Invariant cache hit.
[2024-05-30 02:59:51] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Running 386 sub problems to find dead transitions.
[2024-05-30 02:59:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (OVERLAPS) 387/674 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (OVERLAPS) 0/674 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 290 constraints, problems are : Problem set: 0 solved, 386 unsolved in 29507 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 386 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 4 (OVERLAPS) 387/674 variables, 287/290 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 386/676 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/674 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 386 unsolved
At refinement iteration 7 (OVERLAPS) 0/674 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 386 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 676 constraints, problems are : Problem set: 0 solved, 386 unsolved in 26040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 386/386 constraints, Known Traps: 0/0 constraints]
After SMT, in 55641ms problems are : Problem set: 0 solved, 386 unsolved
Search for dead transitions found 0 dead transitions in 55648ms
Starting structural reductions in LTL mode, iteration 1 : 287/320 places, 387/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56145 ms. Remains : 287/320 places, 387/423 transitions.
[2024-05-30 03:00:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:00:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:00:47] [INFO ] Input system was already deterministic with 387 transitions.
[2024-05-30 03:00:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:00:47] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:00:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11430069027087684296.gal : 2 ms
[2024-05-30 03:00:47] [INFO ] Time to serialize properties into /tmp/CTLFireability15462898936995663972.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/CTLFireability11430069027087684296.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15462898936995663972.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,7.47336e+21,3.24228,68368,2,9408,5,322086,6,0,1521,308353,0


Converting to forward existential form...Done !
original formula: (E((((!((E((p296==1) U (p440==1)) * (p400==1))) * (p224!=1)) * !(AX((p214==1)))) + (p273==1)) U EX(((p271==1)&&(p151==1)))) * AG(EX(EG(((...179
=> equivalent forward existential formula: ([(Init * !(E((((!((E((p296==1) U (p440==1)) * (p400==1))) * (p224!=1)) * !(!(EX(!((p214==1)))))) + (p273==1)) U...261
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t27, t30, t59, t91, t94, t111, t114, t116, t132, t136, t148, t151, t168, t183, t...326
Detected timeout of ITS tools.
[2024-05-30 03:01:17] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:01:17] [INFO ] Applying decomposition
[2024-05-30 03:01:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11831098999232173651.txt' '-o' '/tmp/graph11831098999232173651.bin' '-w' '/tmp/graph11831098999232173651.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11831098999232173651.bin' '-l' '-1' '-v' '-w' '/tmp/graph11831098999232173651.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:01:17] [INFO ] Decomposing Gal with order
[2024-05-30 03:01:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:01:17] [INFO ] Removed a total of 93 redundant transitions.
[2024-05-30 03:01:17] [INFO ] Flatten gal took : 25 ms
[2024-05-30 03:01:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-30 03:01:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16700983677196794973.gal : 4 ms
[2024-05-30 03:01:17] [INFO ] Time to serialize properties into /tmp/CTLFireability8387497745098875748.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/CTLFireability16700983677196794973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8387497745098875748.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,7.47336e+21,0.177396,8588,529,48,9654,657,601,14311,62,2013,0


Converting to forward existential form...Done !
original formula: (E((((!((E((i8.i1.u52.p296==1) U (i13.u73.p440==1)) * (i12.u70.p400==1))) * (i5.i1.u37.p224!=1)) * !(AX((i5.i0.u35.p214==1)))) + (i7.i1.u...269
=> equivalent forward existential formula: ([(Init * !(E((((!((E((i8.i1.u52.p296==1) U (i13.u73.p440==1)) * (i12.u70.p400==1))) * (i5.i1.u37.p224!=1)) * !(...351
Reverse transition relation is NOT exact ! Due to transitions t3, t30, t94, t114, t151, i0.t10, i0.i0.u2.t351, i0.i2.u105.t27, i1.i1.u19.t317, i2.i1.u18.t3...536
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,0.612697,22844,1,0,38823,657,4201,74977,299,2020,98036
FORMULA SmartHome-PT-19-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Graph (trivial) has 342 edges and 320 vertex of which 179 / 320 are part of one of the 15 SCC in 1 ms
Free SCC test removed 164 places
Ensure Unique test removed 219 transitions
Reduce isomorphic transitions removed 219 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 155 transition count 149
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 61 rules applied. Total rules applied 116 place count 101 transition count 142
Reduce places removed 4 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 6 rules applied. Total rules applied 122 place count 97 transition count 140
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 124 place count 96 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 95 transition count 139
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 125 place count 95 transition count 134
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 135 place count 90 transition count 134
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 153 place count 72 transition count 111
Iterating global reduction 5 with 18 rules applied. Total rules applied 171 place count 72 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 174 place count 72 transition count 108
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 177 place count 69 transition count 105
Iterating global reduction 6 with 3 rules applied. Total rules applied 180 place count 69 transition count 105
Performed 36 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 252 place count 33 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 256 place count 33 transition count 64
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 258 place count 32 transition count 63
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 261 place count 29 transition count 51
Iterating global reduction 8 with 3 rules applied. Total rules applied 264 place count 29 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 268 place count 27 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 8 with 15 rules applied. Total rules applied 283 place count 27 transition count 34
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 285 place count 25 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 285 place count 25 transition count 33
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 287 place count 24 transition count 33
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 289 place count 22 transition count 29
Iterating global reduction 9 with 2 rules applied. Total rules applied 291 place count 22 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 292 place count 21 transition count 28
Applied a total of 292 rules in 34 ms. Remains 21 /320 variables (removed 299) and now considering 28/423 (removed 395) transitions.
[2024-05-30 03:01:18] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
// Phase 1: matrix 22 rows 21 cols
[2024-05-30 03:01:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 03:01:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 03:01:18] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-05-30 03:01:18] [INFO ] Invariant cache hit.
[2024-05-30 03:01:18] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-30 03:01:18] [INFO ] Redundant transitions in 39 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-30 03:01:18] [INFO ] Flow matrix only has 22 transitions (discarded 6 similar events)
[2024-05-30 03:01:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/36 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 2/38 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/43 variables, and 20 constraints, problems are : Problem set: 0 solved, 12 unsolved in 243 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 19/36 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 1/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 12 unsolved in 262 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/21 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 512ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 512ms
Starting structural reductions in SI_CTL mode, iteration 1 : 21/320 places, 28/423 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 694 ms. Remains : 21/320 places, 28/423 transitions.
[2024-05-30 03:01:18] [INFO ] Flatten gal took : 2 ms
[2024-05-30 03:01:18] [INFO ] Flatten gal took : 1 ms
[2024-05-30 03:01:18] [INFO ] Input system was already deterministic with 28 transitions.
[2024-05-30 03:01:18] [INFO ] Flatten gal took : 1 ms
[2024-05-30 03:01:18] [INFO ] Flatten gal took : 1 ms
RANDOM walk for 31 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
FORMULA SmartHome-PT-19-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 03:01:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6329935510865458140.gal : 0 ms
[2024-05-30 03:01:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7959174039180057167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6329935510865458140.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7959174039180057167.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 423/423 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 295 transition count 398
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 295 transition count 398
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 295 transition count 396
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 286 transition count 387
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 286 transition count 387
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 281 transition count 382
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 281 transition count 382
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 83 place count 278 transition count 379
Iterating global reduction 1 with 3 rules applied. Total rules applied 86 place count 278 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 277 transition count 378
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 277 transition count 378
Applied a total of 88 rules in 38 ms. Remains 277 /320 variables (removed 43) and now considering 378/423 (removed 45) transitions.
// Phase 1: matrix 378 rows 277 cols
[2024-05-30 03:01:18] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 03:01:19] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 03:01:19] [INFO ] Invariant cache hit.
[2024-05-30 03:01:19] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2024-05-30 03:01:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (OVERLAPS) 0/655 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 280 constraints, problems are : Problem set: 0 solved, 377 unsolved in 25245 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/277 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (OVERLAPS) 378/655 variables, 277/280 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/655 variables, 377/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/655 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 0/655 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 377 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 657 constraints, problems are : Problem set: 0 solved, 377 unsolved in 20511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 277/277 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 0/0 constraints]
After SMT, in 45838ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 45845ms
Starting structural reductions in LTL mode, iteration 1 : 277/320 places, 378/423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46282 ms. Remains : 277/320 places, 378/423 transitions.
[2024-05-30 03:02:05] [INFO ] Flatten gal took : 12 ms
[2024-05-30 03:02:05] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:02:05] [INFO ] Input system was already deterministic with 378 transitions.
[2024-05-30 03:02:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:02:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 03:02:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6287530908595858305.gal : 2 ms
[2024-05-30 03:02:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10849164483970145570.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/CTLFireability6287530908595858305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10849164483970145570.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.34622e+21,3.24265,71940,2,10327,5,336444,6,0,1472,333188,0


Converting to forward existential form...Done !
original formula: E((p538==1) U A((EG(EX((p67==1))) * AX((((p133==1)&&(p298==1))&&(p217==1)))) U AX(EF(((p430==1)&&(p5==1))))))
=> equivalent forward existential formula: [((FwdU(Init,(p538==1)) * !(EG(!(!(EX(!(E(TRUE U ((p430==1)&&(p5==1)))))))))) * !(E(!(!(EX(!(E(TRUE U ((p430==1)...303
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t115, t133, t136, t148, t151, t168, t183, t203, t218,...328
Detected timeout of ITS tools.
[2024-05-30 03:02:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 03:02:35] [INFO ] Applying decomposition
[2024-05-30 03:02:35] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1005361469639593353.txt' '-o' '/tmp/graph1005361469639593353.bin' '-w' '/tmp/graph1005361469639593353.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1005361469639593353.bin' '-l' '-1' '-v' '-w' '/tmp/graph1005361469639593353.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:02:35] [INFO ] Decomposing Gal with order
[2024-05-30 03:02:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:02:35] [INFO ] Removed a total of 90 redundant transitions.
[2024-05-30 03:02:35] [INFO ] Flatten gal took : 34 ms
[2024-05-30 03:02:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 17 ms.
[2024-05-30 03:02:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1054235254888566356.gal : 5 ms
[2024-05-30 03:02:35] [INFO ] Time to serialize properties into /tmp/CTLFireability2564289882254466424.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/CTLFireability1054235254888566356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2564289882254466424.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.34622e+21,0.193928,9472,546,58,11209,1067,571,18567,77,2872,0


Converting to forward existential form...Done !
original formula: E((i16.i0.i0.u88.p538==1) U A((EG(EX((i1.u10.p67==1))) * AX((((i2.u23.p133==1)&&(i8.u47.p298==1))&&(i5.u36.p217==1)))) U AX(EF(((i13.u65....183
=> equivalent forward existential formula: [((FwdU(Init,(i16.i0.i0.u88.p538==1)) * !(EG(!(!(EX(!(E(TRUE U ((i13.u65.p430==1)&&(i4.u1.p5==1)))))))))) * !(E(...387
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t94, t136, t151, t256, i1.u18.t337, i2.u22.t306, i3.u27.t288, i4.u1.t340, i4.u1.t34...512
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
(forward)formula 0,1,0.679586,23464,1,0,35761,1067,4028,82799,410,2872,104752
FORMULA SmartHome-PT-19-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-30 03:02:36] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:02:36] [INFO ] Flatten gal took : 8 ms
[2024-05-30 03:02:36] [INFO ] Applying decomposition
[2024-05-30 03:02:36] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2847402578332871655.txt' '-o' '/tmp/graph2847402578332871655.bin' '-w' '/tmp/graph2847402578332871655.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2847402578332871655.bin' '-l' '-1' '-v' '-w' '/tmp/graph2847402578332871655.weights' '-q' '0' '-e' '0.001'
[2024-05-30 03:02:36] [INFO ] Decomposing Gal with order
[2024-05-30 03:02:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 03:02:36] [INFO ] Removed a total of 80 redundant transitions.
[2024-05-30 03:02:36] [INFO ] Flatten gal took : 19 ms
[2024-05-30 03:02:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-30 03:02:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15102382613906464430.gal : 4 ms
[2024-05-30 03:02:36] [INFO ] Time to serialize properties into /tmp/CTLFireability3789505373676682132.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/CTLFireability15102382613906464430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3789505373676682132.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,8.90834e+22,0.230544,10344,674,49,13199,718,648,23446,69,2340,0


Converting to forward existential form...Done !
original formula: E((E(EF((i2.u15.p71==1)) U (((i0.u65.p340!=1) * E(((i15.u1.p2==1)&&(i12.u89.p472==1)) U (i7.u53.p286==1))) * E((i12.u85.p458==1) U (i8.u5...294
=> equivalent forward existential formula: ([(EY(FwdU(Init,(E(E(TRUE U (i2.u15.p71==1)) U (((i0.u65.p340!=1) * E(((i15.u1.p2==1)&&(i12.u89.p472==1)) U (i7....688
Reverse transition relation is NOT exact ! Due to transitions t3, t72, t167, t291, i0.u63.t201, i1.u28.t327, i2.u19.t349, i2.u19.t379, i2.u121.t8, i2.u121....671
(forward)formula 0,1,585.743,2218376,1,0,2.85032e+06,718,1393,5.45031e+06,129,2714,833134
FORMULA SmartHome-PT-19-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 1246997 ms.

BK_STOP 1717038742496

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

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