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.r532-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 ltsminxred
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 r532-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 1717259759211

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:36:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 16:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:36:02] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2024-06-01 16:36:02] [INFO ] Transformed 653 places.
[2024-06-01 16:36:02] [INFO ] Transformed 706 transitions.
[2024-06-01 16:36:02] [INFO ] Found NUPN structural information;
[2024-06-01 16:36:02] [INFO ] Parsed PT model containing 653 places and 706 transitions and 1618 arcs in 635 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 40 ms.
Deduced a syphon composed of 206 places in 17 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 263 ms. Remains 271 /447 variables (removed 176) and now considering 361/530 (removed 169) transitions.
// Phase 1: matrix 361 rows 271 cols
[2024-06-01 16:36:03] [INFO ] Computed 4 invariants in 38 ms
[2024-06-01 16:36:03] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-06-01 16:36:03] [INFO ] Invariant cache hit.
[2024-06-01 16:36:04] [INFO ] Implicit Places using invariants and state equation in 704 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-06-01 16:36:04] [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 29028 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 26682 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 55952ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 55997ms
Starting structural reductions in LTL mode, iteration 1 : 271/447 places, 361/530 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57672 ms. Remains : 271/447 places, 361/530 transitions.
Support contains 33 out of 271 places after structural reductions.
[2024-06-01 16:37:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 16:37:00] [INFO ] Flatten gal took : 117 ms
[2024-06-01 16:37:00] [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-06-01 16:37:00] [INFO ] Flatten gal took : 55 ms
[2024-06-01 16:37:01] [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 (128 resets) in 1498 ms. (26 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (10 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
[2024-06-01 16:37:01] [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 439 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 431 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 880ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 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 5 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.1 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 1 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 57 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 57 ms. Remains : 2/271 places, 2/361 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 26 ms
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 28 ms
[2024-06-01 16:37:02] [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.11 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 37 ms. Remains 236 /271 variables (removed 35) and now considering 324/361 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 236/271 places, 324/361 transitions.
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 24 ms
[2024-06-01 16:37:02] [INFO ] Input system was already deterministic with 324 transitions.
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 42 ms. Remains 235 /271 variables (removed 36) and now considering 322/361 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 235/271 places, 322/361 transitions.
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 21 ms
[2024-06-01 16:37:02] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:37:02] [INFO ] Input system was already deterministic with 322 transitions.
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 34 ms. Remains 244 /271 variables (removed 27) and now considering 332/361 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 244/271 places, 332/361 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 20 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 17 ms
[2024-06-01 16:37:03] [INFO ] Input system was already deterministic with 332 transitions.
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 27 ms. Remains 238 /271 variables (removed 33) and now considering 325/361 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 238/271 places, 325/361 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:37:03] [INFO ] Input system was already deterministic with 325 transitions.
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 25 ms. Remains 237 /271 variables (removed 34) and now considering 323/361 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 237/271 places, 323/361 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 16 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:37:03] [INFO ] Input system was already deterministic with 323 transitions.
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 23 ms. Remains 236 /271 variables (removed 35) and now considering 323/361 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 236/271 places, 323/361 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 15 ms
[2024-06-01 16:37:03] [INFO ] Input system was already deterministic with 323 transitions.
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 23 ms. Remains 237 /271 variables (removed 34) and now considering 324/361 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 237/271 places, 324/361 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 12 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 13 ms
[2024-06-01 16:37:03] [INFO ] Input system was already deterministic with 324 transitions.
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 14 ms
[2024-06-01 16:37:03] [INFO ] Flatten gal took : 14 ms
[2024-06-01 16:37:03] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-01 16:37:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 271 places, 361 transitions and 800 arcs took 6 ms.
Total runtime 61751 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2024-02
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2024-03
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2024-07
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2024-11
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2023-12
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2023-14
Could not compute solution for formula : SmartHome-PT-18-CTLCardinality-2023-15

BK_STOP 1717259823871

--------------------
content from stderr:

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name SmartHome-PT-18-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/527/ctl_0_
ctl formula name SmartHome-PT-18-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/527/ctl_1_
ctl formula name SmartHome-PT-18-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/527/ctl_2_
ctl formula name SmartHome-PT-18-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/527/ctl_3_
ctl formula name SmartHome-PT-18-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/527/ctl_4_
ctl formula name SmartHome-PT-18-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/527/ctl_5_
ctl formula name SmartHome-PT-18-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/527/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
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 ltsminxred"
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 r532-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 ;