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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 12 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 12 03:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 120K 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-16-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-16-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-16-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717035286060

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 02:14:48] [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:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:14:49] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-05-30 02:14:49] [INFO ] Transformed 499 places.
[2024-05-30 02:14:49] [INFO ] Transformed 533 transitions.
[2024-05-30 02:14:49] [INFO ] Found NUPN structural information;
[2024-05-30 02:14:49] [INFO ] Parsed PT model containing 499 places and 533 transitions and 1222 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 37 ms.
Deduced a syphon composed of 156 places in 24 ms
Reduce places removed 156 places and 129 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-16-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-16-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 65 out of 343 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 343/343 places, 404/404 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 330 transition count 404
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 92 place count 251 transition count 325
Iterating global reduction 1 with 79 rules applied. Total rules applied 171 place count 251 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 177 place count 251 transition count 319
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 189 place count 239 transition count 307
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 239 transition count 307
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 212 place count 228 transition count 296
Iterating global reduction 2 with 11 rules applied. Total rules applied 223 place count 228 transition count 296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 227 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 227 transition count 295
Applied a total of 225 rules in 195 ms. Remains 227 /343 variables (removed 116) and now considering 295/404 (removed 109) transitions.
// Phase 1: matrix 295 rows 227 cols
[2024-05-30 02:14:49] [INFO ] Computed 3 invariants in 34 ms
[2024-05-30 02:14:50] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-05-30 02:14:50] [INFO ] Invariant cache hit.
[2024-05-30 02:14:50] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 891 ms to find 0 implicit places.
Running 294 sub problems to find dead transitions.
[2024-05-30 02:14:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/522 variables, 227/230 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 0/522 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 230 constraints, problems are : Problem set: 0 solved, 294 unsolved in 20350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 2 (OVERLAPS) 1/227 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 295/522 variables, 227/230 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 294/524 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 7 (OVERLAPS) 0/522 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 524 constraints, problems are : Problem set: 0 solved, 294 unsolved in 15655 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 0/0 constraints]
After SMT, in 36207ms problems are : Problem set: 0 solved, 294 unsolved
Search for dead transitions found 0 dead transitions in 36255ms
Starting structural reductions in LTL mode, iteration 1 : 227/343 places, 295/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37388 ms. Remains : 227/343 places, 295/404 transitions.
Support contains 65 out of 227 places after structural reductions.
[2024-05-30 02:15:27] [INFO ] Flatten gal took : 71 ms
[2024-05-30 02:15:27] [INFO ] Flatten gal took : 29 ms
[2024-05-30 02:15:27] [INFO ] Input system was already deterministic with 295 transitions.
Support contains 48 out of 227 places (down from 65) after GAL structural reductions.
FORMULA SmartHome-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (159 resets) in 1795 ms. (22 steps per ms) remains 1/41 properties
BEST_FIRST walk for 40003 steps (16 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
[2024-05-30 02:15:27] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/89 variables, 16/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/94 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 120/214 variables, 37/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 123/337 variables, 61/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/337 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/338 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 80/418 variables, 44/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/418 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 57/475 variables, 30/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/475 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 21/496 variables, 12/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/496 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 13/509 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/509 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 7/516 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/516 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 6/522 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/522 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/522 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 522/522 variables, and 230 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/37 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 52/89 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/94 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/94 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 120/214 variables, 37/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/214 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 123/337 variables, 61/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/337 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/338 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/338 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/338 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 80/418 variables, 44/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/418 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 57/475 variables, 30/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/475 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 21/496 variables, 12/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/496 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 13/509 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/509 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 7/516 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/516 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 6/522 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/522 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/522 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 522/522 variables, and 231 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 568ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 295/295 transitions.
Graph (trivial) has 235 edges and 227 vertex of which 114 / 227 are part of one of the 9 SCC in 5 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 154 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 157 transitions.
Graph (complete) has 190 edges and 122 vertex of which 119 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.9 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 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 46 rules applied. Total rules applied 48 place count 119 transition count 91
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 74 transition count 82
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 107 place count 69 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 107 place count 69 transition count 78
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 115 place count 65 transition count 78
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 126 place count 54 transition count 67
Iterating global reduction 3 with 11 rules applied. Total rules applied 137 place count 54 transition count 67
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 3 with 4 rules applied. Total rules applied 141 place count 54 transition count 63
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 143 place count 53 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 143 place count 53 transition count 61
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 145 place count 52 transition count 61
Performed 27 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 199 place count 25 transition count 30
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 39 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 5 with 16 rules applied. Total rules applied 215 place count 15 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 217 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 218 place count 14 transition count 11
Reduce places removed 4 places and 0 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 7 with 6 rules applied. Total rules applied 224 place count 10 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 226 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 226 place count 8 transition count 8
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 228 place count 7 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 229 place count 6 transition count 7
Applied a total of 229 rules in 72 ms. Remains 6 /227 variables (removed 221) and now considering 7/295 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 6/227 places, 7/295 transitions.
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
[2024-05-30 02:15:28] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:15:28] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:15:28] [INFO ] Input system was already deterministic with 295 transitions.
Computed a total of 55 stabilizing places and 54 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 208 transition count 276
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 208 transition count 276
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 208 transition count 272
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 201 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 201 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 201 transition count 264
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 196 transition count 259
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 196 transition count 259
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 193 transition count 256
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 193 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 192 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 192 transition count 255
Applied a total of 75 rules in 31 ms. Remains 192 /227 variables (removed 35) and now considering 255/295 (removed 40) transitions.
// Phase 1: matrix 255 rows 192 cols
[2024-05-30 02:15:28] [INFO ] Computed 3 invariants in 5 ms
[2024-05-30 02:15:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-30 02:15:28] [INFO ] Invariant cache hit.
[2024-05-30 02:15:28] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-30 02:15:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 195 constraints, problems are : Problem set: 0 solved, 254 unsolved in 14617 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 254/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 449 constraints, problems are : Problem set: 0 solved, 254 unsolved in 11916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 26590ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 26601ms
Starting structural reductions in LTL mode, iteration 1 : 192/227 places, 255/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26868 ms. Remains : 192/227 places, 255/295 transitions.
[2024-05-30 02:15:55] [INFO ] Flatten gal took : 26 ms
[2024-05-30 02:15:55] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:15:55] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-30 02:15:55] [INFO ] Flatten gal took : 23 ms
[2024-05-30 02:15:55] [INFO ] Flatten gal took : 23 ms
[2024-05-30 02:15:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12251012641400152992.gal : 11 ms
[2024-05-30 02:15:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4133559157398756641.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/CTLFireability12251012641400152992.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4133559157398756641.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.5593e+14,0.667349,18176,2,3986,5,67846,6,0,1015,70736,0


Converting to forward existential form...Done !
original formula: E((!(EF(AG(E((p158==1) U ((p2==1)&&(p352==1)))))) * A((E((p39==1) U ((p226==1)&&(p486==1))) * !(E((p93==1) U (p154==1)))) U ((p375!=1) + ...201
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(E(TRUE U !(E(TRUE U !(E((p158==1) U ((p2==1)&&(p352==1)))))))) * !((E(!(((p375!=1) + E(TRUE ...405
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t34, t63, t95, t98, t115, t118, t135, t139, t141, t154, t158, t175, t190, t210,...286
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-30 02:16:25] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:16:25] [INFO ] Applying decomposition
[2024-05-30 02:16:25] [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/graph15034278347363740889.txt' '-o' '/tmp/graph15034278347363740889.bin' '-w' '/tmp/graph15034278347363740889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15034278347363740889.bin' '-l' '-1' '-v' '-w' '/tmp/graph15034278347363740889.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:16:26] [INFO ] Decomposing Gal with order
[2024-05-30 02:16:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:16:26] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-30 02:16:26] [INFO ] Flatten gal took : 93 ms
[2024-05-30 02:16:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2024-05-30 02:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability17438194954897420880.gal : 13 ms
[2024-05-30 02:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12342436785930806345.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/CTLFireability17438194954897420880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12342436785930806345.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.5593e+14,0.121829,6912,396,45,6018,927,476,10068,61,3085,0


Converting to forward existential form...Done !
original formula: E((!(EF(AG(E((i4.u23.p158==1) U ((i0.i0.u1.p2==1)&&(i10.i0.u51.p352==1)))))) * A((E((i9.i0.u3.p39==1) U ((i6.u30.p226==1)&&(i5.i1.u72.p48...296
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(!(E(TRUE U !(E(TRUE U !(E((i4.u23.p158==1) U ((i0.i0.u1.p2==1)&&(i10.i0.u51.p352==1)))))))) * ...556
Reverse transition relation is NOT exact ! Due to transitions t10, t34, t98, t118, i0.i0.u1.t227, i0.i1.u70.t8, i1.u5.t224, i2.u14.t210, i3.i1.u18.t190, i4...438
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
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 6
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local 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
(forward)formula 0,1,26.9369,293880,1,0,480651,1327,3944,826299,333,5689,406814
FORMULA SmartHome-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 207 transition count 275
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 207 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 207 transition count 271
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 200 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 200 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 200 transition count 263
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 195 transition count 258
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 195 transition count 258
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 191 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 191 transition count 254
Applied a total of 77 rules in 20 ms. Remains 191 /227 variables (removed 36) and now considering 254/295 (removed 41) transitions.
// Phase 1: matrix 254 rows 191 cols
[2024-05-30 02:16:53] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:16:53] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-30 02:16:53] [INFO ] Invariant cache hit.
[2024-05-30 02:16:53] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-30 02:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/445 variables, 191/194 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/445 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 194 constraints, problems are : Problem set: 0 solved, 253 unsolved in 14447 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/190 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/191 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/445 variables, 191/194 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/445 variables, 253/447 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 0/445 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 447 constraints, problems are : Problem set: 0 solved, 253 unsolved in 10746 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 191/191 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 25267ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 25273ms
Starting structural reductions in LTL mode, iteration 1 : 191/227 places, 254/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25671 ms. Remains : 191/227 places, 254/295 transitions.
[2024-05-30 02:17:18] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:17:18] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:17:18] [INFO ] Input system was already deterministic with 254 transitions.
[2024-05-30 02:17:19] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:17:19] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:17:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9240461593236761864.gal : 3 ms
[2024-05-30 02:17:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15502658670557271184.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/CTLFireability9240461593236761864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15502658670557271184.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.4784e+14,0.725049,19580,2,3742,5,73484,6,0,1010,77748,0


Converting to forward existential form...Done !
original formula: (AX(AG(((p245==1)||(p261==1)))) + EF((p329==1)))
=> equivalent forward existential formula: [(FwdU(EY((Init * !(E(TRUE U (p329==1))))),TRUE) * !(((p245==1)||(p261==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t32, t63, t96, t100, t119, t122, t139, t142, t154, t157, t174, t189, t209, t223...281
(forward)formula 0,1,4.95222,122460,1,0,309,647520,531,222,5566,560193,527
FORMULA SmartHome-PT-16-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Graph (trivial) has 237 edges and 227 vertex of which 118 / 227 are part of one of the 10 SCC in 1 ms
Free SCC test removed 108 places
Ensure Unique test removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 118 transition count 109
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 51 rules applied. Total rules applied 94 place count 76 transition count 100
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 100 place count 71 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 70 transition count 99
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 101 place count 70 transition count 95
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 109 place count 66 transition count 95
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 119 place count 56 transition count 85
Iterating global reduction 4 with 10 rules applied. Total rules applied 129 place count 56 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 56 transition count 83
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 183 place count 30 transition count 56
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 186 place count 30 transition count 53
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 188 place count 28 transition count 48
Iterating global reduction 6 with 2 rules applied. Total rules applied 190 place count 28 transition count 48
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 6 with 4 rules applied. Total rules applied 194 place count 26 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 207 place count 26 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 209 place count 24 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 209 place count 24 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 211 place count 23 transition count 32
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 213 place count 21 transition count 28
Iterating global reduction 7 with 2 rules applied. Total rules applied 215 place count 21 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 216 place count 20 transition count 27
Applied a total of 216 rules in 31 ms. Remains 20 /227 variables (removed 207) and now considering 27/295 (removed 268) transitions.
[2024-05-30 02:17:24] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
// Phase 1: matrix 21 rows 20 cols
[2024-05-30 02:17:24] [INFO ] Computed 1 invariants in 0 ms
[2024-05-30 02:17:24] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-30 02:17:24] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:17:24] [INFO ] Invariant cache hit.
[2024-05-30 02:17:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-30 02:17:24] [INFO ] Redundant transitions in 28 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-30 02:17:24] [INFO ] Flow matrix only has 21 transitions (discarded 6 similar events)
[2024-05-30 02:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/36 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/36 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 36/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 11 unsolved in 146 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 18/35 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/36 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/36 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/37 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 1/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/41 variables, and 31 constraints, problems are : Problem set: 0 solved, 11 unsolved in 205 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 19/20 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 364ms
Starting structural reductions in SI_CTL mode, iteration 1 : 20/227 places, 27/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 495 ms. Remains : 20/227 places, 27/295 transitions.
[2024-05-30 02:17:24] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:24] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:24] [INFO ] Input system was already deterministic with 27 transitions.
[2024-05-30 02:17:24] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:24] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1980132682461273334.gal : 2 ms
[2024-05-30 02:17:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6309598370197965196.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/CTLFireability1980132682461273334.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6309598370197965196.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,33120,0.008403,3468,2,58,5,318,6,0,89,306,0


Converting to forward existential form...Done !
original formula: AF(AG(EF((p335==0))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(E(TRUE U (p335==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t17, t19, t20, Intersection with reachable at each step enabled. (destroyed/reverse/inte...178
(forward)formula 0,1,0.023034,3788,1,0,53,2305,74,24,535,1991,59
FORMULA SmartHome-PT-16-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 206 transition count 274
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 206 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 206 transition count 270
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 55 place count 197 transition count 261
Iterating global reduction 1 with 9 rules applied. Total rules applied 64 place count 197 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 197 transition count 260
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 72 place count 190 transition count 253
Iterating global reduction 2 with 7 rules applied. Total rules applied 79 place count 190 transition count 253
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 83 place count 186 transition count 249
Iterating global reduction 2 with 4 rules applied. Total rules applied 87 place count 186 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 185 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 185 transition count 248
Applied a total of 89 rules in 31 ms. Remains 185 /227 variables (removed 42) and now considering 248/295 (removed 47) transitions.
// Phase 1: matrix 248 rows 185 cols
[2024-05-30 02:17:24] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:17:24] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-30 02:17:24] [INFO ] Invariant cache hit.
[2024-05-30 02:17:24] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-30 02:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 188 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12391 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 247/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 435 constraints, problems are : Problem set: 0 solved, 247 unsolved in 9329 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 21791ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 21797ms
Starting structural reductions in LTL mode, iteration 1 : 185/227 places, 248/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22146 ms. Remains : 185/227 places, 248/295 transitions.
[2024-05-30 02:17:46] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:17:46] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:17:46] [INFO ] Input system was already deterministic with 248 transitions.
[2024-05-30 02:17:46] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:17:46] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:17:46] [INFO ] Time to serialize gal into /tmp/CTLFireability823770176573870535.gal : 3 ms
[2024-05-30 02:17:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12187489074211144443.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/CTLFireability823770176573870535.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12187489074211144443.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.90305e+14,0.700389,16856,2,3000,5,60551,6,0,980,63542,0


Converting to forward existential form...Done !
original formula: (EG(AX((((p240==0)||(p91==0)) * EX(TRUE)))) * AX(AG(EX((p207==0)))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EX(!((((p240==0)||(p91==0)) * EX(TRUE))))))))] = FALSE * [(FwdU(EY(Init),TRUE) * !(EX((p207==0)...168
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t203, t217,...280
(forward)formula 0,0,4.1892,97880,1,0,297,454867,513,212,5734,473269,506
FORMULA SmartHome-PT-16-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Graph (trivial) has 235 edges and 227 vertex of which 123 / 227 are part of one of the 10 SCC in 1 ms
Free SCC test removed 113 places
Ensure Unique test removed 149 transitions
Reduce isomorphic transitions removed 149 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 113 transition count 108
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 81 place count 76 transition count 102
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 73 transition count 100
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 71 transition count 100
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 88 place count 71 transition count 97
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 94 place count 68 transition count 97
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 104 place count 58 transition count 87
Iterating global reduction 4 with 10 rules applied. Total rules applied 114 place count 58 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 116 place count 58 transition count 85
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 168 place count 32 transition count 58
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 172 place count 32 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 173 place count 31 transition count 54
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 175 place count 29 transition count 49
Iterating global reduction 7 with 2 rules applied. Total rules applied 177 place count 29 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 179 place count 28 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 7 with 12 rules applied. Total rules applied 191 place count 28 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 192 place count 27 transition count 36
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 192 place count 27 transition count 35
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 194 place count 26 transition count 35
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 196 place count 24 transition count 31
Iterating global reduction 8 with 2 rules applied. Total rules applied 198 place count 24 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 199 place count 23 transition count 30
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 200 place count 22 transition count 30
Applied a total of 200 rules in 31 ms. Remains 22 /227 variables (removed 205) and now considering 30/295 (removed 265) transitions.
[2024-05-30 02:17:51] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
// Phase 1: matrix 24 rows 22 cols
[2024-05-30 02:17:51] [INFO ] Computed 1 invariants in 1 ms
[2024-05-30 02:17:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-30 02:17:51] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-30 02:17:51] [INFO ] Invariant cache hit.
[2024-05-30 02:17:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-30 02:17:51] [INFO ] Redundant transitions in 25 ms returned []
Running 13 sub problems to find dead transitions.
[2024-05-30 02:17:51] [INFO ] Flow matrix only has 24 transitions (discarded 6 similar events)
[2024-05-30 02:17:51] [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) 1/41 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/46 variables, and 21 constraints, problems are : Problem set: 0 solved, 13 unsolved in 158 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/22 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, 12/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/41 variables, 1/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, 1/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/43 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/46 variables, and 35 constraints, problems are : Problem set: 0 solved, 13 unsolved in 255 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/22 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 418ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 418ms
Starting structural reductions in SI_CTL mode, iteration 1 : 22/227 places, 30/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 545 ms. Remains : 22/227 places, 30/295 transitions.
[2024-05-30 02:17:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:51] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:17:51] [INFO ] Input system was already deterministic with 30 transitions.
[2024-05-30 02:17:51] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:17:51] [INFO ] Flatten gal took : 1 ms
[2024-05-30 02:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability13218288799729012788.gal : 1 ms
[2024-05-30 02:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2569314902345373748.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/CTLFireability13218288799729012788.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2569314902345373748.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,66240,0.009793,3488,2,91,5,554,6,0,101,459,0


Converting to forward existential form...Done !
original formula: E((p322!=1) U (p217==1))
=> equivalent forward existential formula: [(FwdU(Init,(p322!=1)) * (p217==1))] != FALSE
Hit Full ! (commute/partial/dont) 28/0/2
(forward)formula 0,1,0.013829,3808,1,0,8,666,15,1,208,545,4
FORMULA SmartHome-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 205 transition count 273
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 205 transition count 273
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 205 transition count 269
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 57 place count 196 transition count 260
Iterating global reduction 1 with 9 rules applied. Total rules applied 66 place count 196 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 196 transition count 259
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 74 place count 189 transition count 252
Iterating global reduction 2 with 7 rules applied. Total rules applied 81 place count 189 transition count 252
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 86 place count 184 transition count 247
Iterating global reduction 2 with 5 rules applied. Total rules applied 91 place count 184 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 183 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 183 transition count 246
Applied a total of 93 rules in 33 ms. Remains 183 /227 variables (removed 44) and now considering 246/295 (removed 49) transitions.
// Phase 1: matrix 246 rows 183 cols
[2024-05-30 02:17:51] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:17:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 02:17:51] [INFO ] Invariant cache hit.
[2024-05-30 02:17:51] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2024-05-30 02:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 186 constraints, problems are : Problem set: 0 solved, 245 unsolved in 13352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (OVERLAPS) 1/183 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (OVERLAPS) 246/429 variables, 183/186 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 245/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 7 (OVERLAPS) 0/429 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 431 constraints, problems are : Problem set: 0 solved, 245 unsolved in 12936 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 183/183 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints]
After SMT, in 26343ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 26348ms
Starting structural reductions in LTL mode, iteration 1 : 183/227 places, 246/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26684 ms. Remains : 183/227 places, 246/295 transitions.
[2024-05-30 02:18:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:18:18] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:18:18] [INFO ] Input system was already deterministic with 246 transitions.
[2024-05-30 02:18:18] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:18:18] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:18:18] [INFO ] Time to serialize gal into /tmp/CTLFireability16832826307117660009.gal : 3 ms
[2024-05-30 02:18:18] [INFO ] Time to serialize properties into /tmp/CTLFireability8791686790271142452.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/CTLFireability16832826307117660009.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8791686790271142452.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.44653e+14,0.679169,17644,2,3078,5,63243,6,0,970,66795,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
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, t215,...280
(forward)formula 0,1,3.28602,85040,1,0,293,382921,507,210,5203,398468,498
FORMULA SmartHome-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Graph (trivial) has 215 edges and 227 vertex of which 85 / 227 are part of one of the 8 SCC in 0 ms
Free SCC test removed 77 places
Ensure Unique test removed 103 transitions
Reduce isomorphic transitions removed 103 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 149 transition count 140
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 62 rules applied. Total rules applied 114 place count 98 transition count 129
Reduce places removed 6 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 8 rules applied. Total rules applied 122 place count 92 transition count 127
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 4 rules applied. Total rules applied 126 place count 91 transition count 124
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 129 place count 88 transition count 124
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 129 place count 88 transition count 118
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 141 place count 82 transition count 118
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 149 place count 74 transition count 110
Iterating global reduction 5 with 8 rules applied. Total rules applied 157 place count 74 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 160 place count 74 transition count 107
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 214 place count 47 transition count 80
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 6 rules applied. Total rules applied 220 place count 47 transition count 74
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 222 place count 46 transition count 73
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 223 place count 45 transition count 72
Iterating global reduction 8 with 1 rules applied. Total rules applied 224 place count 45 transition count 72
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 230 place count 42 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 239 place count 42 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 240 place count 41 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 240 place count 41 transition count 59
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 242 place count 40 transition count 59
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 243 place count 40 transition count 59
Applied a total of 243 rules in 25 ms. Remains 40 /227 variables (removed 187) and now considering 59/295 (removed 236) transitions.
[2024-05-30 02:18:21] [INFO ] Flow matrix only has 49 transitions (discarded 10 similar events)
// Phase 1: matrix 49 rows 40 cols
[2024-05-30 02:18:21] [INFO ] Computed 2 invariants in 1 ms
[2024-05-30 02:18:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-30 02:18:21] [INFO ] Flow matrix only has 49 transitions (discarded 10 similar events)
[2024-05-30 02:18:21] [INFO ] Invariant cache hit.
[2024-05-30 02:18:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-30 02:18:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-30 02:18:21] [INFO ] Redundant transitions in 23 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-30 02:18:21] [INFO ] Flow matrix only has 49 transitions (discarded 10 similar events)
[2024-05-30 02:18:21] [INFO ] Invariant cache hit.
[2024-05-30 02:18:21] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 48/88 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 1/89 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/89 variables, and 49 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 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/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (OVERLAPS) 48/88 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 58/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 1/89 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/89 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/89 variables, and 107 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1610 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 3404ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 3405ms
Starting structural reductions in SI_CTL mode, iteration 1 : 40/227 places, 59/295 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3543 ms. Remains : 40/227 places, 59/295 transitions.
[2024-05-30 02:18:25] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:18:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:18:25] [INFO ] Input system was already deterministic with 59 transitions.
[2024-05-30 02:18:25] [INFO ] Flatten gal took : 2 ms
[2024-05-30 02:18:25] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:18:25] [INFO ] Time to serialize gal into /tmp/CTLFireability8897889176176267237.gal : 1 ms
[2024-05-30 02:18:25] [INFO ] Time to serialize properties into /tmp/CTLFireability4887055582085746010.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/CTLFireability8897889176176267237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4887055582085746010.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03219e+07,0.023993,3696,2,184,5,1197,6,0,202,1207,0


Converting to forward existential form...Done !
original formula: (AG(AF((((p158==0)&&(p352==0))&&((p352==0)||(p493==0))))) + A(A(((p2==1)&&(p384==1)) U (A(((p83==1)||(p362==1)) U (p61!=1)) * EG(EF((p364...177
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!((p334==1)) U (!(!((E(!((!((E(!((p61!=1)) U (!(((p83==1)||(p362==1))) * !((p61!=1))))...575
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t10, t12, t14, t16, t19, t21, t24, t29, t35, t44, t45, t51, Intersection with reacha...228
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 47/0/12
(forward)formula 0,0,0.891167,25476,1,0,481,133091,170,294,1494,180421,518
FORMULA SmartHome-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 209 transition count 277
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 209 transition count 277
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 209 transition count 275
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 201 transition count 267
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 201 transition count 267
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 194 transition count 260
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 194 transition count 260
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 189 transition count 255
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 189 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 79 place count 188 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 80 place count 188 transition count 254
Applied a total of 80 rules in 11 ms. Remains 188 /227 variables (removed 39) and now considering 254/295 (removed 41) transitions.
// Phase 1: matrix 254 rows 188 cols
[2024-05-30 02:18:26] [INFO ] Computed 3 invariants in 1 ms
[2024-05-30 02:18:26] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 02:18:26] [INFO ] Invariant cache hit.
[2024-05-30 02:18:26] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-30 02:18:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/442 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/442 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 442/442 variables, and 191 constraints, problems are : Problem set: 0 solved, 253 unsolved in 14663 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/187 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 1/188 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 254/442 variables, 188/191 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 253/444 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 7 (OVERLAPS) 0/442 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Int declared 442/442 variables, and 444 constraints, problems are : Problem set: 0 solved, 253 unsolved in 13263 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 188/188 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 27961ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 27970ms
Starting structural reductions in LTL mode, iteration 1 : 188/227 places, 254/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28184 ms. Remains : 188/227 places, 254/295 transitions.
[2024-05-30 02:18:54] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:18:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:18:54] [INFO ] Input system was already deterministic with 254 transitions.
[2024-05-30 02:18:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:18:54] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:18:54] [INFO ] Time to serialize gal into /tmp/CTLFireability12547085279306223370.gal : 3 ms
[2024-05-30 02:18:54] [INFO ] Time to serialize properties into /tmp/CTLFireability8171101523627516956.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/CTLFireability12547085279306223370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8171101523627516956.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.1209e+14,1.01053,27076,2,3987,5,110189,6,0,998,111707,0


Converting to forward existential form...Done !
original formula: (EX(EF((EX(((p2==0)||(p102==0))) + EG((p270==0))))) * ((A((AX(FALSE) * !((EG((p219==1)) + EX((p25==1))))) U AX(FALSE)) + EF(((p298==1)&&(...214
=> equivalent forward existential formula: ([(Init * !(EX(E(TRUE U (EX(((p2==0)||(p102==0))) + EG((p270==0)))))))] = FALSE * ([((Init * !((!((E(!(!(EX(!(FA...575
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t94, t97, t114, t117, t134, t137, t149, t152, t169, t185, t205, t219,...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-30 02:19:24] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:19:24] [INFO ] Applying decomposition
[2024-05-30 02:19:24] [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/graph17213374059368628300.txt' '-o' '/tmp/graph17213374059368628300.bin' '-w' '/tmp/graph17213374059368628300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17213374059368628300.bin' '-l' '-1' '-v' '-w' '/tmp/graph17213374059368628300.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:19:24] [INFO ] Decomposing Gal with order
[2024-05-30 02:19:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:19:24] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-30 02:19:24] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:19:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-30 02:19:24] [INFO ] Time to serialize gal into /tmp/CTLFireability3382577672623879279.gal : 4 ms
[2024-05-30 02:19:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10218117001812348265.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/CTLFireability3382577672623879279.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10218117001812348265.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.1209e+14,0.259166,8460,337,36,9940,453,445,18070,54,1416,0


Converting to forward existential form...Done !
original formula: (EX(EF((EX(((u1.p2==0)||(i1.u14.p102==0))) + EG((i8.i0.u43.p270==0))))) * ((A((AX(FALSE) * !((EG((i6.u34.p219==1)) + EX((u1.p25==1))))) U...278
=> equivalent forward existential formula: ([(Init * !(EX(E(TRUE U (EX(((u1.p2==0)||(i1.u14.p102==0))) + EG((i8.i0.u43.p270==0)))))))] = FALSE * ([((Init *...662
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t97, t117, t137, t152, u1.t222, u1.t223, u1.t224, i0.u8.t219, i1.u14.t205, i2.u15.t...408
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local 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 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
(forward)formula 0,1,0.73732,16644,1,0,24524,481,3033,51362,281,1416,51927
FORMULA SmartHome-PT-16-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 206 transition count 274
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 206 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 206 transition count 270
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 198 transition count 262
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 198 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 198 transition count 261
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 67 place count 194 transition count 257
Iterating global reduction 2 with 4 rules applied. Total rules applied 71 place count 194 transition count 257
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 192 transition count 255
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 192 transition count 255
Applied a total of 75 rules in 16 ms. Remains 192 /227 variables (removed 35) and now considering 255/295 (removed 40) transitions.
// Phase 1: matrix 255 rows 192 cols
[2024-05-30 02:19:25] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:19:25] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 02:19:25] [INFO ] Invariant cache hit.
[2024-05-30 02:19:25] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-30 02:19:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/447 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 447/447 variables, and 195 constraints, problems are : Problem set: 0 solved, 254 unsolved in 15469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/192 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/447 variables, 192/195 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 254/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/447 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 447/447 variables, and 449 constraints, problems are : Problem set: 0 solved, 254 unsolved in 11226 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 26746ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 26751ms
Starting structural reductions in LTL mode, iteration 1 : 192/227 places, 255/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27116 ms. Remains : 192/227 places, 255/295 transitions.
[2024-05-30 02:19:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:19:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:19:52] [INFO ] Input system was already deterministic with 255 transitions.
[2024-05-30 02:19:52] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:19:52] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability7566906381220508018.gal : 2 ms
[2024-05-30 02:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability11742422378904007262.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/CTLFireability7566906381220508018.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11742422378904007262.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.21299e+14,0.49916,16628,2,3358,5,60721,6,0,1015,61595,0


Converting to forward existential form...Done !
original formula: (EX((p321==0)) + AX(AF(((EX(((p2==1)&&(p257==1))) + EX((p356==1))) * !(A((p227==1) U (p307==1)))))))
=> equivalent forward existential formula: [FwdG(EY((Init * !(EX((p321==0))))),!(((EX(((p2==1)&&(p257==1))) + EX((p356==1))) * !(!((E(!((p307==1)) U (!((p2...213
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t32, t61, t96, t99, t116, t123, t140, t143, t155, t158, t175, t190, t210, t224,...280
(forward)formula 0,1,26.1228,658472,1,0,860,4.04442e+06,544,499,5613,4.59174e+06,1094
FORMULA SmartHome-PT-16-CTLFireability-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 207 transition count 275
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 207 transition count 275
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 207 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 53 place count 198 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 62 place count 198 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 198 transition count 261
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 70 place count 191 transition count 254
Iterating global reduction 2 with 7 rules applied. Total rules applied 77 place count 191 transition count 254
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 186 transition count 249
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 186 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 185 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 185 transition count 248
Applied a total of 89 rules in 13 ms. Remains 185 /227 variables (removed 42) and now considering 248/295 (removed 47) transitions.
// Phase 1: matrix 248 rows 185 cols
[2024-05-30 02:20:18] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:20:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 02:20:18] [INFO ] Invariant cache hit.
[2024-05-30 02:20:19] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2024-05-30 02:20:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 188 constraints, problems are : Problem set: 0 solved, 247 unsolved in 14570 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 247 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 2 (OVERLAPS) 1/185 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 4 (OVERLAPS) 248/433 variables, 185/188 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 247/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 7 (OVERLAPS) 0/433 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 247 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 435 constraints, problems are : Problem set: 0 solved, 247 unsolved in 12328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 185/185 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 0/0 constraints]
After SMT, in 26945ms problems are : Problem set: 0 solved, 247 unsolved
Search for dead transitions found 0 dead transitions in 26950ms
Starting structural reductions in LTL mode, iteration 1 : 185/227 places, 248/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27198 ms. Remains : 185/227 places, 248/295 transitions.
[2024-05-30 02:20:46] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:20:46] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:20:46] [INFO ] Input system was already deterministic with 248 transitions.
[2024-05-30 02:20:46] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:20:46] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:20:46] [INFO ] Time to serialize gal into /tmp/CTLFireability1704377814882531646.gal : 1 ms
[2024-05-30 02:20:46] [INFO ] Time to serialize properties into /tmp/CTLFireability498984301150462543.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/CTLFireability1704377814882531646.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability498984301150462543.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,3.92138e+14,0.601044,17648,2,3147,5,63560,6,0,980,66738,0


Converting to forward existential form...Done !
original formula: !(A((AX(A((p250==1) U (p141==1))) + EX((EX(((p226==1)&&(p389==1))) + AG((p358==1))))) U AG(((p35!=1) + E((p366==1) U (p304==1))))))
=> equivalent forward existential formula: ([((FwdU((FwdU(Init,!(!(E(TRUE U !(((p35!=1) + E((p366==1) U (p304==1)))))))) * !((!(EX(!(!((E(!((p141==1)) U (!...417
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t92, t95, t112, t115, t132, t135, t147, t150, t168, t183, t203, t217,...280
(forward)formula 0,1,26.0536,694300,1,0,910,4.11668e+06,543,533,6066,4.9099e+06,1163
FORMULA SmartHome-PT-16-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 295/295 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 206 transition count 274
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 206 transition count 274
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 206 transition count 270
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 198 transition count 262
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 198 transition count 262
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 198 transition count 261
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 69 place count 192 transition count 255
Iterating global reduction 2 with 6 rules applied. Total rules applied 75 place count 192 transition count 255
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 188 transition count 251
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 188 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 187 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 187 transition count 250
Applied a total of 85 rules in 12 ms. Remains 187 /227 variables (removed 40) and now considering 250/295 (removed 45) transitions.
// Phase 1: matrix 250 rows 187 cols
[2024-05-30 02:21:12] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:21:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 02:21:12] [INFO ] Invariant cache hit.
[2024-05-30 02:21:12] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2024-05-30 02:21:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (OVERLAPS) 0/437 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Real declared 437/437 variables, and 190 constraints, problems are : Problem set: 0 solved, 249 unsolved in 14610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 249 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 2 (OVERLAPS) 1/187 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 4 (OVERLAPS) 250/437 variables, 187/190 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 249/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 7 (OVERLAPS) 0/437 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 249 unsolved
No progress, stopping.
After SMT solving in domain Int declared 437/437 variables, and 439 constraints, problems are : Problem set: 0 solved, 249 unsolved in 12724 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 0/0 constraints]
After SMT, in 27366ms problems are : Problem set: 0 solved, 249 unsolved
Search for dead transitions found 0 dead transitions in 27369ms
Starting structural reductions in LTL mode, iteration 1 : 187/227 places, 250/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27595 ms. Remains : 187/227 places, 250/295 transitions.
[2024-05-30 02:21:39] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:21:39] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:21:39] [INFO ] Input system was already deterministic with 250 transitions.
[2024-05-30 02:21:39] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:21:39] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:21:39] [INFO ] Time to serialize gal into /tmp/CTLFireability11587711464131227311.gal : 3 ms
[2024-05-30 02:21:39] [INFO ] Time to serialize properties into /tmp/CTLFireability11281618814142943109.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/CTLFireability11587711464131227311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11281618814142943109.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,3.75515e+14,0.586026,14484,2,3001,5,51088,6,0,990,52047,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + AX((p227==0)))
=> equivalent forward existential formula: [(EY((Init * !(!(EX(!(FALSE)))))) * !((p227==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t118, t135, t138, t150, t153, t170, t185, t205, t219,...280
(forward)formula 0,1,3.50652,83392,1,0,300,388794,517,215,5471,373392,508
FORMULA SmartHome-PT-16-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-30 02:21:43] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:21:43] [INFO ] Flatten gal took : 7 ms
Total runtime 414886 ms.

BK_STOP 1717035703580

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

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