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.r377-smll-171683810200354.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 greatspnxred
Input is SmartHome-PT-03, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683810200354
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.5K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 03:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 12 03:52 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 31K 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-03-CTLFireability-2024-00
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-01
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-02
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-03
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-04
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-05
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-06
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-07
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-08
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-09
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-10
FORMULA_NAME SmartHome-PT-03-CTLFireability-2024-11
FORMULA_NAME SmartHome-PT-03-CTLFireability-2023-12
FORMULA_NAME SmartHome-PT-03-CTLFireability-2023-13
FORMULA_NAME SmartHome-PT-03-CTLFireability-2023-14
FORMULA_NAME SmartHome-PT-03-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716998766415

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmartHome-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 16:06:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 16:06:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 16:06:08] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2024-05-29 16:06:08] [INFO ] Transformed 45 places.
[2024-05-29 16:06:08] [INFO ] Transformed 145 transitions.
[2024-05-29 16:06:08] [INFO ] Found NUPN structural information;
[2024-05-29 16:06:08] [INFO ] Parsed PT model containing 45 places and 145 transitions and 405 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Ensure Unique test removed 77 transitions
Reduce redundant transitions removed 77 transitions.
Support contains 38 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 68/68 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 45 transition count 55
Applied a total of 13 rules in 29 ms. Remains 45 /45 variables (removed 0) and now considering 55/68 (removed 13) transitions.
[2024-05-29 16:06:08] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
// Phase 1: matrix 40 rows 45 cols
[2024-05-29 16:06:08] [INFO ] Computed 19 invariants in 14 ms
[2024-05-29 16:06:08] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-29 16:06:08] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
[2024-05-29 16:06:08] [INFO ] Invariant cache hit.
[2024-05-29 16:06:09] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-05-29 16:06:09] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-29 16:06:09] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
[2024-05-29 16:06:09] [INFO ] Invariant cache hit.
[2024-05-29 16:06:09] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/45 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 39/84 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 22/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (OVERLAPS) 1/85 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (OVERLAPS) 0/85 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 132 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1963 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 1/44 variables, 17/61 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 1/45 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 39/84 variables, 45/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 22/131 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 54/185 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 13 (OVERLAPS) 1/85 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 15 (OVERLAPS) 0/85 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 186 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1384 ms.
Refiners :[Domain max(s): 45/45 constraints, Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 3422ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3440ms
Starting structural reductions in LTL mode, iteration 1 : 45/45 places, 55/68 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4009 ms. Remains : 45/45 places, 55/68 transitions.
Support contains 38 out of 45 places after structural reductions.
[2024-05-29 16:06:12] [INFO ] Flatten gal took : 31 ms
[2024-05-29 16:06:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 16:06:12] [INFO ] Input system was already deterministic with 55 transitions.
Reduction of identical properties reduced properties to check from 66 to 59
RANDOM walk for 40000 steps (8 resets) in 1346 ms. (29 steps per ms) remains 2/59 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
[2024-05-29 16:06:13] [INFO ] Flow matrix only has 40 transitions (discarded 15 similar events)
[2024-05-29 16:06:13] [INFO ] Invariant cache hit.
[2024-05-29 16:06:13] [INFO ] State equation strengthened by 23 read => feed constraints.
Problem AtomicPropp11 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp10 is UNSAT
After SMT solving in domain Real declared 15/85 variables, and 17 constraints, problems are : Problem set: 2 solved, 0 unsolved in 33 ms.
Refiners :[Domain max(s): 9/45 constraints, Positive P Invariants (semi-flows): 8/18 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/45 constraints, ReadFeed: 0/23 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 51ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 25 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 55 transitions.
Computed a total of 22 stabilizing places and 13 stable transitions
Graph (complete) has 120 edges and 45 vertex of which 44 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 37 transition count 47
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 37 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 37 transition count 44
Applied a total of 19 rules in 6 ms. Remains 37 /45 variables (removed 8) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 37/45 places, 44/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 5 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Graph (trivial) has 24 edges and 45 vertex of which 2 / 45 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 118 edges and 44 vertex of which 43 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 37 transition count 47
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 37 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 30 place count 29 transition count 39
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 27 transition count 35
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 27 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 27 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 42 place count 26 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 43 place count 26 transition count 27
Applied a total of 43 rules in 43 ms. Remains 26 /45 variables (removed 19) and now considering 27/55 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 26/45 places, 27/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Graph (trivial) has 31 edges and 45 vertex of which 6 / 45 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 114 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 64 edges and 33 vertex of which 30 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Graph (trivial) has 28 edges and 30 vertex of which 18 / 30 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 21 transition count 40
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Graph (complete) has 13 edges and 12 vertex of which 2 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Iterating post reduction 1 with 37 rules applied. Total rules applied 53 place count 2 transition count 4
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 2 transition count 3
Applied a total of 54 rules in 7 ms. Remains 2 /45 variables (removed 43) and now considering 3/55 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 2/45 places, 3/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 36 transition count 44
Applied a total of 20 rules in 5 ms. Remains 36 /45 variables (removed 9) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 36/45 places, 44/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 6 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 40 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 40 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 40 transition count 47
Applied a total of 13 rules in 4 ms. Remains 40 /45 variables (removed 5) and now considering 47/55 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/45 places, 47/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 38 transition count 48
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 38 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 38 transition count 45
Applied a total of 17 rules in 4 ms. Remains 38 /45 variables (removed 7) and now considering 45/55 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 38/45 places, 45/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 40 transition count 50
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 40 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 40 transition count 47
Applied a total of 13 rules in 4 ms. Remains 40 /45 variables (removed 5) and now considering 47/55 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/45 places, 47/55 transitions.
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:13] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:13] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 42 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 52
Applied a total of 6 rules in 3 ms. Remains 42 /45 variables (removed 3) and now considering 52/55 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/45 places, 52/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 42 transition count 52
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 42 transition count 52
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 42 transition count 50
Applied a total of 8 rules in 4 ms. Remains 42 /45 variables (removed 3) and now considering 50/55 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/45 places, 50/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 36 transition count 44
Applied a total of 20 rules in 4 ms. Remains 36 /45 variables (removed 9) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/45 places, 44/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 36 transition count 44
Applied a total of 20 rules in 5 ms. Remains 36 /45 variables (removed 9) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 36/45 places, 44/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 55
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 36 transition count 47
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 36 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 36 transition count 44
Applied a total of 20 rules in 4 ms. Remains 36 /45 variables (removed 9) and now considering 44/55 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 36/45 places, 44/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 39 transition count 49
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 39 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 39 transition count 46
Applied a total of 15 rules in 4 ms. Remains 39 /45 variables (removed 6) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 39/45 places, 46/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 41 transition count 51
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 41 transition count 51
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 39 transition count 49
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 38 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 38 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 17 place count 38 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 18 place count 37 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 37 transition count 43
Applied a total of 19 rules in 12 ms. Remains 37 /45 variables (removed 8) and now considering 43/55 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 37/45 places, 43/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 44 transition count 55
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 38 transition count 49
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 38 transition count 49
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 38 transition count 46
Applied a total of 16 rules in 4 ms. Remains 38 /45 variables (removed 7) and now considering 46/55 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 38/45 places, 46/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 3 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 46 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 45/45 places, 55/55 transitions.
Graph (trivial) has 24 edges and 45 vertex of which 4 / 45 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 116 edges and 43 vertex of which 42 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 38 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 38 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 30 transition count 39
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 26 transition count 31
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 26 transition count 31
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 39 place count 26 transition count 26
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 40 place count 25 transition count 25
Iterating global reduction 0 with 1 rules applied. Total rules applied 41 place count 25 transition count 25
Applied a total of 41 rules in 13 ms. Remains 25 /45 variables (removed 20) and now considering 25/55 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 25/45 places, 25/55 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 2 ms
[2024-05-29 16:06:14] [INFO ] Input system was already deterministic with 25 transitions.
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:14] [INFO ] Flatten gal took : 4 ms
[2024-05-29 16:06:14] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-29 16:06:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 45 places, 55 transitions and 173 arcs took 6 ms.
Total runtime 6109 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SmartHome-PT-03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 45
TRANSITIONS: 55
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.002s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 541
MODEL NAME: /home/mcc/execution/414/model
45 places, 55 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SmartHome-PT-03-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SmartHome-PT-03-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716998775362

--------------------
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 CTLFireability -timeout 360 -rebuildPNML

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-03"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SmartHome-PT-03, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r377-smll-171683810200354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-03.tgz
mv SmartHome-PT-03 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;