About the Execution of LTSMin+red for SmartHome-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 266.939 | 9974.00 | 22412.00 | 188.30 | TFT?????F?T??F?? | normal |
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-171683811300345.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-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683811300345
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 04:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 12 04:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 04:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 12 04:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:57 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 27K 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-02-CTLCardinality-2024-00
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-01
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-02
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-03
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-04
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-05
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-06
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-07
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-08
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-09
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-10
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2024-11
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2023-12
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2023-13
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2023-14
FORMULA_NAME SmartHome-PT-02-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717256411245
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-02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:40:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 15:40:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:40:13] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-06-01 15:40:13] [INFO ] Transformed 41 places.
[2024-06-01 15:40:13] [INFO ] Transformed 127 transitions.
[2024-06-01 15:40:13] [INFO ] Found NUPN structural information;
[2024-06-01 15:40:13] [INFO ] Parsed PT model containing 41 places and 127 transitions and 359 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 30 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 66 transitions
Reduce redundant transitions removed 66 transitions.
FORMULA SmartHome-PT-02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 61/61 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 40 transition count 48
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 40 transition count 48
Applied a total of 14 rules in 59 ms. Remains 40 /41 variables (removed 1) and now considering 48/61 (removed 13) transitions.
[2024-06-01 15:40:14] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
// Phase 1: matrix 36 rows 40 cols
[2024-06-01 15:40:14] [INFO ] Computed 16 invariants in 13 ms
[2024-06-01 15:40:14] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 15:40:14] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
[2024-06-01 15:40:14] [INFO ] Invariant cache hit.
[2024-06-01 15:40:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 15:40:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-06-01 15:40:14] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
[2024-06-01 15:40:14] [INFO ] Invariant cache hit.
[2024-06-01 15:40:14] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 35/75 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 1/76 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/76 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 78 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2154 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/39 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 35/75 variables, 40/56 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/76 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/76 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 76/76 variables, and 125 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
After SMT, in 3975ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 4005ms
Starting structural reductions in LTL mode, iteration 1 : 40/41 places, 48/61 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4647 ms. Remains : 40/41 places, 48/61 transitions.
Support contains 30 out of 40 places after structural reductions.
[2024-06-01 15:40:19] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 15:40:19] [INFO ] Flatten gal took : 44 ms
FORMULA SmartHome-PT-02-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-02-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:40:19] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:40:19] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (8 resets) in 2061 ms. (19 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
[2024-06-01 15:40:19] [INFO ] Flow matrix only has 36 transitions (discarded 12 similar events)
[2024-06-01 15:40:19] [INFO ] Invariant cache hit.
[2024-06-01 15:40:20] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem AtomicPropp0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 23/27 variables, 13/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/50 variables, 27/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 9/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/52 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/54 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/54 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/54 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/56 variables, 1/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/56 variables, 1/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/56 variables, 0/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/64 variables, 4/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/64 variables, 4/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/64 variables, 0/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/66 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/66 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/71 variables, 4/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/71 variables, 3/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/71 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/75 variables, 2/75 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/75 variables, 2/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/75 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/76 variables, 1/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/76 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/76 variables, 0/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 76/76 variables, and 78 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp4 is UNSAT
After SMT solving in domain Int declared 4/76 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 2/15 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/40 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 196ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA SmartHome-PT-02-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 48 transitions.
Computed a total of 20 stabilizing places and 13 stable transitions
Graph (complete) has 108 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 35 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 35 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 35 transition count 42
Applied a total of 11 rules in 7 ms. Remains 35 /40 variables (removed 5) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 35/40 places, 42/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Graph (trivial) has 17 edges and 40 vertex of which 2 / 40 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 106 edges and 39 vertex of which 38 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 35 transition count 43
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 35 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 30 transition count 38
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 29 transition count 36
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 29 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 29 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 28 transition count 31
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 28 transition count 31
Applied a total of 26 rules in 41 ms. Remains 28 /40 variables (removed 12) and now considering 31/48 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 28/40 places, 31/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Graph (trivial) has 25 edges and 40 vertex of which 4 / 40 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 104 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 61 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Graph (trivial) has 25 edges and 28 vertex of which 16 / 28 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 12 place count 20 transition count 37
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 14 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 46 place count 10 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 9 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 47 place count 9 transition count 8
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 51 place count 7 transition count 8
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 7 transition count 7
Applied a total of 52 rules in 9 ms. Remains 7 /40 variables (removed 33) and now considering 7/48 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 7/40 places, 7/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 2 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 1 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 35 transition count 44
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 35 transition count 44
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 35 transition count 42
Applied a total of 11 rules in 5 ms. Remains 35 /40 variables (removed 5) and now considering 42/48 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 35/40 places, 42/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 34 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 34 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 34 transition count 41
Applied a total of 13 rules in 4 ms. Remains 34 /40 variables (removed 6) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 34/40 places, 41/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 34 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 34 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 34 transition count 41
Applied a total of 13 rules in 5 ms. Remains 34 /40 variables (removed 6) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 34/40 places, 41/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 36 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 36 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 36 transition count 44
Applied a total of 8 rules in 4 ms. Remains 36 /40 variables (removed 4) and now considering 44/48 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/40 places, 44/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 34 transition count 43
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 34 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 34 transition count 41
Applied a total of 13 rules in 4 ms. Remains 34 /40 variables (removed 6) and now considering 41/48 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 34/40 places, 41/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Graph (trivial) has 23 edges and 40 vertex of which 4 / 40 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 104 edges and 38 vertex of which 37 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 34 transition count 41
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 34 transition count 41
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 22 place count 27 transition count 34
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 24 transition count 28
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 24 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 24 transition count 24
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 23 transition count 23
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 23 transition count 23
Applied a total of 34 rules in 14 ms. Remains 23 /40 variables (removed 17) and now considering 23/48 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 23/40 places, 23/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 3 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 39 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 36 transition count 45
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 36 transition count 45
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 36 transition count 43
Applied a total of 9 rules in 4 ms. Remains 36 /40 variables (removed 4) and now considering 43/48 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/40 places, 43/48 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:40:20] [INFO ] Input system was already deterministic with 43 transitions.
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Flatten gal took : 5 ms
[2024-06-01 15:40:20] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2024-06-01 15:40:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 48 transitions and 154 arcs took 8 ms.
Total runtime 7222 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-03
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-04
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-05
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-06
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-07
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-09
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2024-11
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2023-12
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2023-14
Could not compute solution for formula : SmartHome-PT-02-CTLCardinality-2023-15
BK_STOP 1717256421219
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-02-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/520/ctl_0_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/520/ctl_1_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/520/ctl_2_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/520/ctl_3_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/520/ctl_4_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/520/ctl_5_
ctl formula name SmartHome-PT-02-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/520/ctl_6_
ctl formula name SmartHome-PT-02-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/520/ctl_7_
ctl formula name SmartHome-PT-02-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/520/ctl_8_
ctl formula name SmartHome-PT-02-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/520/ctl_9_
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-02"
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-02, 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-171683811300345"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-02.tgz
mv SmartHome-PT-02 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 '
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 ;