fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r500-smll-171649588000338
Last Updated
July 7, 2024

About the Execution of LTSMin+red for IBM5964-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
327.560 11387.00 26317.00 159.60 T???TFFF????FTFF 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.r500-smll-171649588000338.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 IBM5964-PT-none, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000338
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 11 18:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 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 171K 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 IBM5964-PT-none-CTLFireability-2024-00
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-01
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-02
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-03
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-04
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-05
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-06
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-07
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-08
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-09
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-10
FORMULA_NAME IBM5964-PT-none-CTLFireability-2024-11
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-12
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-13
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-14
FORMULA_NAME IBM5964-PT-none-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717286074816

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:54:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:54:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:54:37] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2024-06-01 23:54:37] [INFO ] Transformed 263 places.
[2024-06-01 23:54:37] [INFO ] Transformed 139 transitions.
[2024-06-01 23:54:37] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 409 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 168 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 34 places
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 220 transition count 139
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 219 transition count 138
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 219 transition count 138
Applied a total of 45 rules in 78 ms. Remains 219 /263 variables (removed 44) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 219 cols
[2024-06-01 23:54:38] [INFO ] Computed 88 invariants in 48 ms
[2024-06-01 23:54:38] [INFO ] Implicit Places using invariants in 558 ms returned [175]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 635 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 218/263 places, 138/139 transitions.
Applied a total of 0 rules in 9 ms. Remains 218 /218 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 770 ms. Remains : 218/263 places, 138/139 transitions.
Support contains 168 out of 218 places after structural reductions.
[2024-06-01 23:54:39] [INFO ] Flatten gal took : 86 ms
[2024-06-01 23:54:39] [INFO ] Flatten gal took : 39 ms
[2024-06-01 23:54:39] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 165 out of 218 places (down from 168) after GAL structural reductions.
RANDOM walk for 40001 steps (846 resets) in 2982 ms. (13 steps per ms) remains 59/71 properties
BEST_FIRST walk for 4004 steps (21 resets) in 71 ms. (55 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 56 ms. (70 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 66 ms. (59 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 55 ms. (71 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 50 ms. (78 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 57 ms. (69 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 49 ms. (80 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 59 ms. (66 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 51 ms. (76 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 97 ms. (40 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 64 ms. (61 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 80 ms. (49 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 62 ms. (63 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (21 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 26 ms. (148 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (22 resets) in 27 ms. (143 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 42 ms. (93 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (23 resets) in 45 ms. (87 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 71 ms. (55 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 51 ms. (76 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 41 ms. (95 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (20 resets) in 36 ms. (108 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (21 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 52 ms. (75 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 31 ms. (125 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (21 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (21 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 23 ms. (166 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (20 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (23 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (21 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (22 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
// Phase 1: matrix 138 rows 218 cols
[2024-06-01 23:54:41] [INFO ] Computed 87 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 27/173 variables, 9/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 6/179 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 122/301 variables, 179/264 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 59 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
At refinement iteration 8 (OVERLAPS) 46/347 variables, 32/296 constraints. Problems are: Problem set: 18 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/296 constraints. Problems are: Problem set: 18 solved, 41 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 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 AtomicPropp13 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
After SMT solving in domain Real declared 356/356 variables, and 303 constraints, problems are : Problem set: 59 solved, 0 unsolved in 3599 ms.
Refiners :[Generalized P Invariants (flows): 85/87 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 3693ms problems are : Problem set: 59 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 59 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 23 ms
[2024-06-01 23:54:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 23:54:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 22 ms
FORMULA IBM5964-PT-none-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 138 transitions.
Support contains 14 out of 218 places (down from 16) after GAL structural reductions.
Computed a total of 218 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 218 transition count 138
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 3 formulas.
FORMULA IBM5964-PT-none-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 79 places
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 139 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 89 place count 129 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 99 place count 129 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 128 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 128 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 127 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 127 transition count 126
Applied a total of 103 rules in 63 ms. Remains 127 /218 variables (removed 91) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 127/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 13 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 13 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 18 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 123/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 17 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 123/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 81 places
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 137 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 91 place count 127 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 101 place count 127 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 126 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 126 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 125 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 125 transition count 126
Applied a total of 105 rules in 19 ms. Remains 125 /218 variables (removed 93) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 125/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 12 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 13 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 17 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 123/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 11 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 11 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 18 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 123/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 10 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 11 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 138/138 transitions.
Ensure Unique test removed 83 places
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 135 transition count 138
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 125 transition count 128
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 125 transition count 128
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 104 place count 124 transition count 127
Iterating global reduction 1 with 1 rules applied. Total rules applied 105 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 106 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 107 place count 123 transition count 126
Applied a total of 107 rules in 16 ms. Remains 123 /218 variables (removed 95) and now considering 126/138 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 123/218 places, 126/138 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 10 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 11 ms
[2024-06-01 23:54:45] [INFO ] Input system was already deterministic with 126 transitions.
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 16 ms
[2024-06-01 23:54:45] [INFO ] Flatten gal took : 16 ms
[2024-06-01 23:54:45] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 23:54:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 218 places, 138 transitions and 460 arcs took 6 ms.
Total runtime 8532 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-01
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-02
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-03
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-08
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-09
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-10
Could not compute solution for formula : IBM5964-PT-none-CTLFireability-2024-11

BK_STOP 1717286086203

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name IBM5964-PT-none-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/501/ctl_0_
ctl formula name IBM5964-PT-none-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/501/ctl_1_
ctl formula name IBM5964-PT-none-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/501/ctl_2_
ctl formula name IBM5964-PT-none-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/501/ctl_3_
ctl formula name IBM5964-PT-none-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/501/ctl_4_
ctl formula name IBM5964-PT-none-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/501/ctl_5_
ctl formula name IBM5964-PT-none-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/501/ctl_6_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM5964-PT-none"
export BK_EXAMINATION="CTLFireability"
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 IBM5964-PT-none, 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 r500-smll-171649588000338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 ;