About the Execution of LTSMin+red for Election2020-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
322.544 | 9303.00 | 21971.00 | 172.60 | TT?TF???T???FFFF | 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.r492-smll-171636266400209.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 Election2020-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266400209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 19 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 12 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 37K May 18 16:42 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 Election2020-PT-none-CTLCardinality-2024-00
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-01
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-02
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-03
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-04
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-05
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-06
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-07
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-08
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-09
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-10
FORMULA_NAME Election2020-PT-none-CTLCardinality-2024-11
FORMULA_NAME Election2020-PT-none-CTLCardinality-2023-12
FORMULA_NAME Election2020-PT-none-CTLCardinality-2023-13
FORMULA_NAME Election2020-PT-none-CTLCardinality-2023-14
FORMULA_NAME Election2020-PT-none-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717237924130
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Election2020-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:32:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:32:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:32:07] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2024-06-01 10:32:07] [INFO ] Transformed 53 places.
[2024-06-01 10:32:07] [INFO ] Transformed 102 transitions.
[2024-06-01 10:32:07] [INFO ] Parsed PT model containing 53 places and 102 transitions and 204 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 37 ms.
Support contains 45 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 102/102 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 100
Applied a total of 2 rules in 64 ms. Remains 52 /53 variables (removed 1) and now considering 100/102 (removed 2) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 3ms
// Phase 1: matrix 100 rows 52 cols
[2024-06-01 10:32:07] [INFO ] Computed 1 invariants in 28 ms
[2024-06-01 10:32:07] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 10:32:07] [INFO ] Invariant cache hit.
[2024-06-01 10:32:08] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Starting structural reductions in LTL mode, iteration 1 : 52/53 places, 100/102 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 52/53 places, 100/102 transitions.
Support contains 45 out of 52 places after structural reductions.
[2024-06-01 10:32:08] [INFO ] Flatten gal took : 57 ms
[2024-06-01 10:32:08] [INFO ] Flatten gal took : 24 ms
[2024-06-01 10:32:08] [INFO ] Input system was already deterministic with 100 transitions.
RANDOM walk for 40007 steps (644 resets) in 3629 ms. (11 steps per ms) remains 55/81 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 55/55 properties
[2024-06-01 10:32:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 17/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 55 unsolved
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 22 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 370 ms of which 4 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 2 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-06-01 10:32:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
[2024-06-01 10:32:12] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 55 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp75 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
After SMT solving in domain Real declared 152/152 variables, and 73 constraints, problems are : Problem set: 55 solved, 0 unsolved in 2441 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 20/20 constraints]
After SMT, in 2513ms problems are : Problem set: 55 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 55 atomic propositions for a total of 16 simplifications.
FORMULA Election2020-PT-none-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:32:12] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 14 ms
[2024-06-01 10:32:12] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Election2020-PT-none-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Election2020-PT-none-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 12 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 100 transitions.
Support contains 23 out of 52 places (down from 30) after GAL structural reductions.
Computed a total of 52 stabilizing places and 100 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 100
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Election2020-PT-none-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Graph (complete) has 100 edges and 52 vertex of which 2 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.2 ms
Discarding 50 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 19 ms. Remains 2 /52 variables (removed 50) and now considering 2/100 (removed 98) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 2/52 places, 2/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 1 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 1 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 50 transition count 50
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 72 place count 30 transition count 30
Iterating global reduction 1 with 20 rules applied. Total rules applied 92 place count 30 transition count 30
Applied a total of 92 rules in 11 ms. Remains 30 /52 variables (removed 22) and now considering 30/100 (removed 70) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 30/52 places, 30/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 3 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 3 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 50 transition count 50
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 82 place count 20 transition count 20
Iterating global reduction 1 with 30 rules applied. Total rules applied 112 place count 20 transition count 20
Applied a total of 112 rules in 4 ms. Remains 20 /52 variables (removed 32) and now considering 20/100 (removed 80) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 20/52 places, 20/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 50 transition count 50
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 81 place count 21 transition count 21
Iterating global reduction 1 with 29 rules applied. Total rules applied 110 place count 21 transition count 21
Applied a total of 110 rules in 4 ms. Remains 21 /52 variables (removed 31) and now considering 21/100 (removed 79) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 21/52 places, 21/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 50 transition count 50
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 78 place count 24 transition count 24
Iterating global reduction 1 with 26 rules applied. Total rules applied 104 place count 24 transition count 24
Applied a total of 104 rules in 4 ms. Remains 24 /52 variables (removed 28) and now considering 24/100 (removed 76) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 24/52 places, 24/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 2 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Graph (complete) has 100 edges and 52 vertex of which 2 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 96 output transitions
Drop transitions (Output transitions of discarded places.) removed 96 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 2 ms. Remains 2 /52 variables (removed 50) and now considering 2/100 (removed 98) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 2/52 places, 2/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 1 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 1 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 100/100 transitions.
Graph (complete) has 100 edges and 52 vertex of which 1 are kept as prefixes of interest. Removing 51 places using SCC suffix rule.1 ms
Discarding 51 places :
Also discarding 98 output transitions
Drop transitions (Output transitions of discarded places.) removed 98 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 2 ms. Remains 1 /52 variables (removed 51) and now considering 1/100 (removed 99) transitions.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 0ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 1/52 places, 1/100 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 1 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 0 ms
[2024-06-01 10:32:12] [INFO ] Input system was already deterministic with 1 transitions.
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 10 ms
[2024-06-01 10:32:12] [INFO ] Flatten gal took : 9 ms
[2024-06-01 10:32:12] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 10:32:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 100 transitions and 200 arcs took 5 ms.
Total runtime 6192 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=
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="Election2020-PT-none"
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 Election2020-PT-none, 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 r492-smll-171636266400209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Election2020-PT-none.tgz
mv Election2020-PT-none 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 ;