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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 25K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 12 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 03:51 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 159K 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-18-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-18-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717036610213

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 02:36:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 02:36:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:36:53] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2024-05-30 02:36:53] [INFO ] Transformed 653 places.
[2024-05-30 02:36:53] [INFO ] Transformed 706 transitions.
[2024-05-30 02:36:53] [INFO ] Found NUPN structural information;
[2024-05-30 02:36:53] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
Deduced a syphon composed of 206 places in 16 ms
Reduce places removed 206 places and 176 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-18-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 447 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 447/447 places, 530/530 transitions.
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 431 transition count 530
Discarding 115 places :
Symmetric choice reduction at 1 with 115 rule applications. Total rules 131 place count 316 transition count 415
Iterating global reduction 1 with 115 rules applied. Total rules applied 246 place count 316 transition count 415
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 253 place count 316 transition count 408
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 273 place count 296 transition count 388
Iterating global reduction 2 with 20 rules applied. Total rules applied 293 place count 296 transition count 388
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 310 place count 279 transition count 371
Iterating global reduction 2 with 17 rules applied. Total rules applied 327 place count 279 transition count 371
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 329 place count 279 transition count 369
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 336 place count 272 transition count 362
Iterating global reduction 3 with 7 rules applied. Total rules applied 343 place count 272 transition count 362
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 344 place count 271 transition count 361
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 271 transition count 361
Applied a total of 345 rules in 261 ms. Remains 271 /447 variables (removed 176) and now considering 361/530 (removed 169) transitions.
// Phase 1: matrix 361 rows 271 cols
[2024-05-30 02:36:53] [INFO ] Computed 4 invariants in 30 ms
[2024-05-30 02:36:54] [INFO ] Implicit Places using invariants in 506 ms returned []
[2024-05-30 02:36:54] [INFO ] Invariant cache hit.
[2024-05-30 02:36:54] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 1031 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-30 02:36:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 2/271 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 361/632 variables, 271/275 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 0/632 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 275 constraints, problems are : Problem set: 0 solved, 360 unsolved in 29113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/269 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (OVERLAPS) 2/271 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 361/632 variables, 271/275 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/632 variables, 360/635 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/632 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/632 variables, 0/635 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 632/632 variables, and 635 constraints, problems are : Problem set: 0 solved, 360 unsolved in 25115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 0/0 constraints]
After SMT, in 54467ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 54515ms
Starting structural reductions in LTL mode, iteration 1 : 271/447 places, 361/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55881 ms. Remains : 271/447 places, 361/530 transitions.
Support contains 33 out of 271 places after structural reductions.
[2024-05-30 02:37:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 02:37:49] [INFO ] Flatten gal took : 134 ms
[2024-05-30 02:37:49] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA SmartHome-PT-18-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-18-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:37:49] [INFO ] Flatten gal took : 48 ms
[2024-05-30 02:37:49] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 19 out of 271 places (down from 33) after GAL structural reductions.
RANDOM walk for 40000 steps (124 resets) in 1653 ms. (24 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (12 resets) in 234 ms. (170 steps per ms) remains 1/1 properties
[2024-05-30 02:37:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/25 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 54/79 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/85 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 20/105 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/105 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 155/260 variables, 60/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/260 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 124/384 variables, 58/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/384 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 101/485 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/485 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 87/572 variables, 42/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/572 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 31/603 variables, 22/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/603 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 8/611 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/611 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/616 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/616 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/620 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/620 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 6/626 variables, 2/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/626 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 6/632 variables, 3/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/632 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/632 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 275 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/22 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 54/79 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 6/85 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/85 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 20/105 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/105 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 155/260 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/260 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 124/384 variables, 58/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/384 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 101/485 variables, 50/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/485 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 87/572 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/572 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 31/603 variables, 22/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/603 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 8/611 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/611 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 5/616 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/616 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/620 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/620 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 6/626 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/626 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 6/632 variables, 3/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/632 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/632 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 632/632 variables, and 276 constraints, problems are : Problem set: 0 solved, 1 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 817ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 361/361 transitions.
Graph (trivial) has 291 edges and 271 vertex of which 163 / 271 are part of one of the 14 SCC in 6 ms
Free SCC test removed 149 places
Drop transitions (Empty/Sink Transition effects.) removed 222 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 228 transitions.
Graph (complete) has 187 edges and 122 vertex of which 110 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 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 49 rules applied. Total rules applied 51 place count 110 transition count 78
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 100 place count 65 transition count 74
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 63 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 102 place count 63 transition count 72
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 61 transition count 72
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 116 place count 51 transition count 62
Iterating global reduction 3 with 10 rules applied. Total rules applied 126 place count 51 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 129 place count 51 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 50 transition count 58
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 50 transition count 58
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 132 place count 49 transition count 57
Iterating global reduction 4 with 1 rules applied. Total rules applied 133 place count 49 transition count 57
Performed 28 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 189 place count 21 transition count 27
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 27 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 20 rules applied. Total rules applied 209 place count 12 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 11 transition count 7
Reduce places removed 3 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 5 with 5 rules applied. Total rules applied 215 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 217 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 217 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 222 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 222 place count 3 transition count 2
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 224 place count 2 transition count 2
Applied a total of 224 rules in 66 ms. Remains 2 /271 variables (removed 269) and now considering 2/361 (removed 359) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 2/271 places, 2/361 transitions.
RANDOM walk for 4 steps (0 resets) in 7 ms. (0 steps per ms) remains 0/1 properties
[2024-05-30 02:37:51] [INFO ] Flatten gal took : 32 ms
[2024-05-30 02:37:51] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:37:51] [INFO ] Input system was already deterministic with 361 transitions.
Computed a total of 55 stabilizing places and 54 stable transitions
Graph (complete) has 425 edges and 271 vertex of which 270 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 253 transition count 344
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 253 transition count 344
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 253 transition count 341
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 47 place count 244 transition count 332
Iterating global reduction 2 with 9 rules applied. Total rules applied 56 place count 244 transition count 332
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 62 place count 238 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 238 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 236 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 236 transition count 324
Applied a total of 72 rules in 32 ms. Remains 236 /271 variables (removed 35) and now considering 324/361 (removed 37) transitions.
// Phase 1: matrix 324 rows 236 cols
[2024-05-30 02:37:51] [INFO ] Computed 3 invariants in 6 ms
[2024-05-30 02:37:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 02:37:51] [INFO ] Invariant cache hit.
[2024-05-30 02:37:51] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-30 02:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/560 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/560 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 239 constraints, problems are : Problem set: 0 solved, 323 unsolved in 22557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/560 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 323/562 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/560 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 562 constraints, problems are : Problem set: 0 solved, 323 unsolved in 19261 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 41887ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 41895ms
Starting structural reductions in LTL mode, iteration 1 : 236/271 places, 324/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42199 ms. Remains : 236/271 places, 324/361 transitions.
[2024-05-30 02:38:33] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:38:33] [INFO ] Flatten gal took : 27 ms
[2024-05-30 02:38:33] [INFO ] Input system was already deterministic with 324 transitions.
[2024-05-30 02:38:33] [INFO ] Flatten gal took : 25 ms
[2024-05-30 02:38:34] [INFO ] Flatten gal took : 23 ms
[2024-05-30 02:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality1470303594027880472.gal : 13 ms
[2024-05-30 02:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality786342142578011185.ctl : 4 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/CTLCardinality1470303594027880472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality786342142578011185.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,1.40751e+19,1.58677,40020,2,6181,5,181392,6,0,1256,171542,0


Converting to forward existential form...Done !
original formula: EF(AX((AF(AX(FALSE)) + AG((p29==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!((!(EG(!(!(EX(!(FALSE)))))) + !(E(TRUE U !((p29==1)))))))))] != 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, t216,...310
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,11.0224,249512,1,0,410,1.3275e+06,678,297,7732,1.15097e+06,705
FORMULA SmartHome-PT-18-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 252 transition count 343
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 252 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 252 transition count 339
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 243 transition count 330
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 243 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 65 place count 237 transition count 324
Iterating global reduction 2 with 6 rules applied. Total rules applied 71 place count 237 transition count 324
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 235 transition count 322
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 235 transition count 322
Applied a total of 75 rules in 22 ms. Remains 235 /271 variables (removed 36) and now considering 322/361 (removed 39) transitions.
// Phase 1: matrix 322 rows 235 cols
[2024-05-30 02:38:45] [INFO ] Computed 3 invariants in 2 ms
[2024-05-30 02:38:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-30 02:38:45] [INFO ] Invariant cache hit.
[2024-05-30 02:38:45] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-05-30 02:38:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (OVERLAPS) 0/557 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 238 constraints, problems are : Problem set: 0 solved, 321 unsolved in 22610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 321 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 2 (OVERLAPS) 1/235 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 4 (OVERLAPS) 322/557 variables, 235/238 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 321/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 7 (OVERLAPS) 0/557 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 321 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 559 constraints, problems are : Problem set: 0 solved, 321 unsolved in 19251 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 0/0 constraints]
After SMT, in 41956ms problems are : Problem set: 0 solved, 321 unsolved
Search for dead transitions found 0 dead transitions in 41963ms
Starting structural reductions in LTL mode, iteration 1 : 235/271 places, 322/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42354 ms. Remains : 235/271 places, 322/361 transitions.
[2024-05-30 02:39:27] [INFO ] Flatten gal took : 27 ms
[2024-05-30 02:39:27] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:39:27] [INFO ] Input system was already deterministic with 322 transitions.
[2024-05-30 02:39:27] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:39:27] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:39:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality12733906524315173799.gal : 4 ms
[2024-05-30 02:39:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality16419636417810307725.ctl : 22 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/CTLCardinality12733906524315173799.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16419636417810307725.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,9.38341e+18,1.17546,37460,2,5998,5,166703,6,0,1250,156590,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, t216,...304
(forward)formula 0,1,8.80468,190652,1,0,373,908585,659,272,6671,896234,650
FORMULA SmartHome-PT-18-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 15 place count 256 transition count 347
Iterating global reduction 1 with 14 rules applied. Total rules applied 29 place count 256 transition count 347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 32 place count 256 transition count 344
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 39 place count 249 transition count 337
Iterating global reduction 2 with 7 rules applied. Total rules applied 46 place count 249 transition count 337
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 50 place count 245 transition count 333
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 245 transition count 333
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 244 transition count 332
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 244 transition count 332
Applied a total of 56 rules in 29 ms. Remains 244 /271 variables (removed 27) and now considering 332/361 (removed 29) transitions.
// Phase 1: matrix 332 rows 244 cols
[2024-05-30 02:39:36] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:39:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 02:39:36] [INFO ] Invariant cache hit.
[2024-05-30 02:39:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 331 sub problems to find dead transitions.
[2024-05-30 02:39:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/576 variables, 244/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (OVERLAPS) 0/576 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Real declared 576/576 variables, and 247 constraints, problems are : Problem set: 0 solved, 331 unsolved in 20506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 331 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 2 (OVERLAPS) 1/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 4 (OVERLAPS) 332/576 variables, 244/247 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/576 variables, 331/578 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/576 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 331 unsolved
At refinement iteration 7 (OVERLAPS) 0/576 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 331 unsolved
No progress, stopping.
After SMT solving in domain Int declared 576/576 variables, and 578 constraints, problems are : Problem set: 0 solved, 331 unsolved in 20523 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 244/244 constraints, PredecessorRefiner: 331/331 constraints, Known Traps: 0/0 constraints]
After SMT, in 41106ms problems are : Problem set: 0 solved, 331 unsolved
Search for dead transitions found 0 dead transitions in 41111ms
Starting structural reductions in LTL mode, iteration 1 : 244/271 places, 332/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41463 ms. Remains : 244/271 places, 332/361 transitions.
[2024-05-30 02:40:18] [INFO ] Flatten gal took : 22 ms
[2024-05-30 02:40:18] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:40:18] [INFO ] Input system was already deterministic with 332 transitions.
[2024-05-30 02:40:18] [INFO ] Flatten gal took : 21 ms
[2024-05-30 02:40:18] [INFO ] Flatten gal took : 20 ms
[2024-05-30 02:40:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2912858253912470620.gal : 6 ms
[2024-05-30 02:40:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13290026827603482285.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/CTLCardinality2912858253912470620.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13290026827603482285.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.26467e+19,1.2755,36552,2,6280,5,160329,6,0,1296,154661,0


Converting to forward existential form...Done !
original formula: (AX(EF((p87==1))) + EF((AX(FALSE) * AG(E(((p479==0)||(p435==1)) U (p503==0))))))
=> equivalent forward existential formula: [(EY((Init * !(E(TRUE U (!(EX(!(FALSE))) * !(E(TRUE U !(E(((p479==0)||(p435==1)) U (p503==0)))))))))) * !(E(TRUE...178
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t11, t31, t34, t38, t66, t71, t99, t102, t119, t122, t139, t142, t154, t157, t174, t1...319
(forward)formula 0,1,29.7577,721796,1,0,518,4.80164e+06,690,355,7337,3.55509e+06,854
FORMULA SmartHome-PT-18-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 253 transition count 344
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 253 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 253 transition count 340
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 47 place count 245 transition count 332
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 245 transition count 332
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 60 place count 240 transition count 327
Iterating global reduction 2 with 5 rules applied. Total rules applied 65 place count 240 transition count 327
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 67 place count 238 transition count 325
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 238 transition count 325
Applied a total of 69 rules in 17 ms. Remains 238 /271 variables (removed 33) and now considering 325/361 (removed 36) transitions.
// Phase 1: matrix 325 rows 238 cols
[2024-05-30 02:40:48] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:40:48] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-30 02:40:48] [INFO ] Invariant cache hit.
[2024-05-30 02:40:48] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 324 sub problems to find dead transitions.
[2024-05-30 02:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/563 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (OVERLAPS) 0/563 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 241 constraints, problems are : Problem set: 0 solved, 324 unsolved in 21137 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 324 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 4 (OVERLAPS) 325/563 variables, 238/241 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 324/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
At refinement iteration 7 (OVERLAPS) 0/563 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 324 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 565 constraints, problems are : Problem set: 0 solved, 324 unsolved in 19379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 324/324 constraints, Known Traps: 0/0 constraints]
After SMT, in 40576ms problems are : Problem set: 0 solved, 324 unsolved
Search for dead transitions found 0 dead transitions in 40580ms
Starting structural reductions in LTL mode, iteration 1 : 238/271 places, 325/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40893 ms. Remains : 238/271 places, 325/361 transitions.
[2024-05-30 02:41:29] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:41:29] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:41:29] [INFO ] Input system was already deterministic with 325 transitions.
[2024-05-30 02:41:29] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:41:29] [INFO ] Flatten gal took : 32 ms
[2024-05-30 02:41:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4248448771353029729.gal : 22 ms
[2024-05-30 02:41:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality14417161612579062764.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/CTLCardinality4248448771353029729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14417161612579062764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06847e+19,1.7666,42252,2,7847,5,187249,6,0,1265,186883,0


Converting to forward existential form...Done !
original formula: AG((AF((EF((p392==0)) * EX(((p476==0)&&(p228==1))))) + EF((p255==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(E(TRUE U (p255==1)))),!((E(TRUE U (p392==0)) * EX(((p476==0)&&(p228==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t96, t113, t116, t133, t136, t148, t151, t168, t184, t204, t219,...304
(forward)formula 0,0,19.6239,438288,1,0,409,2.47056e+06,679,298,7341,2.24052e+06,709
FORMULA SmartHome-PT-18-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 254 transition count 344
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 254 transition count 344
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 254 transition count 340
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 245 transition count 331
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 245 transition count 331
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 239 transition count 325
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 239 transition count 325
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 70 place count 237 transition count 323
Iterating global reduction 1 with 2 rules applied. Total rules applied 72 place count 237 transition count 323
Applied a total of 72 rules in 17 ms. Remains 237 /271 variables (removed 34) and now considering 323/361 (removed 38) transitions.
// Phase 1: matrix 323 rows 237 cols
[2024-05-30 02:41:49] [INFO ] Computed 4 invariants in 2 ms
[2024-05-30 02:41:49] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-30 02:41:49] [INFO ] Invariant cache hit.
[2024-05-30 02:41:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-30 02:41:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/560 variables, 237/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/560 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 241 constraints, problems are : Problem set: 0 solved, 322 unsolved in 21750 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 2/237 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/560 variables, 237/241 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 322/563 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/560 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 563 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19294 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 41125ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 41132ms
Starting structural reductions in LTL mode, iteration 1 : 237/271 places, 323/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41463 ms. Remains : 237/271 places, 323/361 transitions.
[2024-05-30 02:42:30] [INFO ] Flatten gal took : 19 ms
[2024-05-30 02:42:30] [INFO ] Flatten gal took : 11 ms
[2024-05-30 02:42:30] [INFO ] Input system was already deterministic with 323 transitions.
[2024-05-30 02:42:30] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:42:30] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:42:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7966819202212204438.gal : 8 ms
[2024-05-30 02:42:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15785200317140614039.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/CTLCardinality7966819202212204438.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15785200317140614039.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0009e+19,1.07576,35056,2,5819,5,155150,6,0,1257,142289,0


Converting to forward existential form...Done !
original formula: AF(EX((EF((p341==1)) * (EG((p334==0)) + A((p496!=1) U AX((p93==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX((E(TRUE U (p341==1)) * (EG((p334==0)) + !((E(!(!(EX(!((p93==1))))) U (!((p496!=1)) * !(!(EX(!((p...211
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t28, t31, t60, t92, t95, t112, t115, t135, t147, t150, t167, t182, t202, t217, t237,...298
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.7402,280996,1,0,480,1.61006e+06,688,358,7733,1.36996e+06,794
FORMULA SmartHome-PT-18-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 252 transition count 343
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 252 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 252 transition count 339
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 244 transition count 331
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 244 transition count 331
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 63 place count 238 transition count 325
Iterating global reduction 2 with 6 rules applied. Total rules applied 69 place count 238 transition count 325
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 236 transition count 323
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 236 transition count 323
Applied a total of 73 rules in 26 ms. Remains 236 /271 variables (removed 35) and now considering 323/361 (removed 38) transitions.
// Phase 1: matrix 323 rows 236 cols
[2024-05-30 02:42:41] [INFO ] Computed 3 invariants in 3 ms
[2024-05-30 02:42:41] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 02:42:41] [INFO ] Invariant cache hit.
[2024-05-30 02:42:41] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-30 02:42:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 0/559 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Real declared 559/559 variables, and 239 constraints, problems are : Problem set: 0 solved, 322 unsolved in 23172 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 4 (OVERLAPS) 323/559 variables, 236/239 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/559 variables, 322/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/559 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 0/559 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 322 unsolved
No progress, stopping.
After SMT solving in domain Int declared 559/559 variables, and 561 constraints, problems are : Problem set: 0 solved, 322 unsolved in 19326 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 0/0 constraints]
After SMT, in 42550ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 42556ms
Starting structural reductions in LTL mode, iteration 1 : 236/271 places, 323/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42984 ms. Remains : 236/271 places, 323/361 transitions.
[2024-05-30 02:43:24] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:43:24] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:43:24] [INFO ] Input system was already deterministic with 323 transitions.
[2024-05-30 02:43:24] [INFO ] Flatten gal took : 44 ms
[2024-05-30 02:43:24] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:43:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality7631669987954949041.gal : 2 ms
[2024-05-30 02:43:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality17929539956243644021.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/CTLCardinality7631669987954949041.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17929539956243644021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00048e+19,1.65624,35896,2,6419,5,154704,6,0,1255,153986,0


Converting to forward existential form...Done !
original formula: AG((EX(TRUE) * (AG(EX(TRUE)) + ((EX((p90==1)) * (p42!=0)) * (p508!=1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(TRUE)))] = FALSE * [(FwdU((FwdU(Init,TRUE) * !(((EX((p90==1)) * (p42!=0)) * (p508!=1))...188
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t91, t94, t111, t114, t131, t134, t146, t149, t166, t181, t201, t216,...304
(forward)formula 0,0,11.2721,246920,1,0,380,1.16971e+06,665,276,7103,1.29726e+06,661
FORMULA SmartHome-PT-18-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 361/361 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 361
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 252 transition count 343
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 252 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 252 transition count 339
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 244 transition count 331
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 244 transition count 331
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 239 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 239 transition count 326
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 237 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 237 transition count 324
Applied a total of 71 rules in 24 ms. Remains 237 /271 variables (removed 34) and now considering 324/361 (removed 37) transitions.
// Phase 1: matrix 324 rows 237 cols
[2024-05-30 02:43:35] [INFO ] Computed 3 invariants in 4 ms
[2024-05-30 02:43:36] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-30 02:43:36] [INFO ] Invariant cache hit.
[2024-05-30 02:43:36] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2024-05-30 02:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/561 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 561/561 variables, and 240 constraints, problems are : Problem set: 0 solved, 323 unsolved in 18379 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (OVERLAPS) 1/237 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (OVERLAPS) 324/561 variables, 237/240 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/561 variables, 323/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/561 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 7 (OVERLAPS) 0/561 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 561/561 variables, and 563 constraints, problems are : Problem set: 0 solved, 323 unsolved in 14761 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints]
After SMT, in 33210ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 33216ms
Starting structural reductions in LTL mode, iteration 1 : 237/271 places, 324/361 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33636 ms. Remains : 237/271 places, 324/361 transitions.
[2024-05-30 02:44:09] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:44:09] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:44:09] [INFO ] Input system was already deterministic with 324 transitions.
[2024-05-30 02:44:09] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:44:09] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:44:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality2243899580294969610.gal : 3 ms
[2024-05-30 02:44:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality5790643981138336563.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/CTLCardinality2243899580294969610.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5790643981138336563.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.01341e+19,1.52373,38868,2,6690,5,170570,6,0,1260,167418,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(((p133==1) * EX((p415==0)))) + EX((p647==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((p133==1) * EX((p415==0)))))) + EX((p647==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t8, t10, t27, t30, t59, t93, t96, t113, t116, t133, t136, t148, t151, t168, t183, t203, t218,...304
Detected timeout of ITS tools.
[2024-05-30 02:44:39] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:44:39] [INFO ] Applying decomposition
[2024-05-30 02:44:39] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5579224681866623794.txt' '-o' '/tmp/graph5579224681866623794.bin' '-w' '/tmp/graph5579224681866623794.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5579224681866623794.bin' '-l' '-1' '-v' '-w' '/tmp/graph5579224681866623794.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:44:40] [INFO ] Decomposing Gal with order
[2024-05-30 02:44:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:44:40] [INFO ] Removed a total of 77 redundant transitions.
[2024-05-30 02:44:40] [INFO ] Flatten gal took : 154 ms
[2024-05-30 02:44:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2024-05-30 02:44:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9224139274511572525.gal : 26 ms
[2024-05-30 02:44:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality55906190941511707.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/CTLCardinality9224139274511572525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality55906190941511707.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 -...260
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.01341e+19,0.234795,8020,390,42,8262,810,498,13555,65,2183,0


Converting to forward existential form...Done !
original formula: EF(AG((AF(((i3.u20.p133==1) * EX((i13.u65.p415==0)))) + EX((i14.i1.i0.u90.p647==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((!(EG(!(((i3.u20.p133==1) * EX((i13.u65.p415==0)))))) + EX((i14.i1.i0.u90.p647=...174
Reverse transition relation is NOT exact ! Due to transitions t10, t30, t96, t116, t136, t151, i1.u8.t287, i2.u17.t273, i3.u21.t253, i4.u22.t238, i5.u27.t2...451
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,2.43072,65044,1,0,115647,810,3348,242402,325,2402,130071
FORMULA SmartHome-PT-18-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-30 02:44:42] [INFO ] Flatten gal took : 16 ms
[2024-05-30 02:44:42] [INFO ] Flatten gal took : 17 ms
Total runtime 470219 ms.

BK_STOP 1717037082958

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-18"
export BK_EXAMINATION="CTLCardinality"
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-18, examination is CTLCardinality"
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-171683811600473"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-18.tgz
mv SmartHome-PT-18 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;