fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r488-tall-171631132700442
Last Updated
July 7, 2024

About the Execution of LTSMin+red for DiscoveryGPU-PT-11a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
301.604 9641.00 18212.00 69.60 F?????????????F? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132700442.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 DiscoveryGPU-PT-11a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132700442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K 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 DiscoveryGPU-PT-11a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717192787155

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:59:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:59:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:59:48] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-31 21:59:48] [INFO ] Transformed 113 places.
[2024-05-31 21:59:48] [INFO ] Transformed 155 transitions.
[2024-05-31 21:59:48] [INFO ] Found NUPN structural information;
[2024-05-31 21:59:48] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 76 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 111 transition count 142
Applied a total of 15 rules in 27 ms. Remains 111 /113 variables (removed 2) and now considering 142/155 (removed 13) transitions.
// Phase 1: matrix 142 rows 111 cols
[2024-05-31 21:59:48] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:59:48] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-31 21:59:48] [INFO ] Invariant cache hit.
[2024-05-31 21:59:48] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-31 21:59:48] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-31 21:59:49] [INFO ] Invariant cache hit.
[2024-05-31 21:59:49] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 201 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 141/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 342 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2635 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6336ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6363ms
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 142/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6779 ms. Remains : 111/113 places, 142/155 transitions.
Support contains 76 out of 111 places after structural reductions.
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 30 ms
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:59:55] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 73 out of 111 places (down from 76) after GAL structural reductions.
RANDOM walk for 14663 steps (120 resets) in 444 ms. (32 steps per ms) remains 0/76 properties
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:59:55] [INFO ] Input system was already deterministic with 142 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 86 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 56 transition count 99
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 48 place count 45 transition count 78
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 36 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 36 transition count 60
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 75 place count 27 transition count 42
Iterating global reduction 2 with 9 rules applied. Total rules applied 84 place count 27 transition count 42
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 93 place count 18 transition count 24
Iterating global reduction 2 with 9 rules applied. Total rules applied 102 place count 18 transition count 24
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 111 place count 9 transition count 15
Iterating global reduction 2 with 9 rules applied. Total rules applied 120 place count 9 transition count 15
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 121 place count 9 transition count 14
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 9 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 8 transition count 13
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 125 place count 6 transition count 11
Applied a total of 125 rules in 24 ms. Remains 6 /111 variables (removed 105) and now considering 11/142 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 6/111 places, 11/142 transitions.
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:59:55] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 242 steps (7 resets) in 8 ms. (26 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 10 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:55] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:59:55] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 10 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 92 transition count 123
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 86 transition count 117
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 6 ms. Remains 86 /111 variables (removed 25) and now considering 117/142 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 86/111 places, 117/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 84 transition count 115
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 84 transition count 115
Applied a total of 54 rules in 6 ms. Remains 84 /111 variables (removed 27) and now considering 115/142 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 84/111 places, 115/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 95 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 5 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 89/111 places, 120/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 40 place count 89 transition count 120
Iterating global reduction 0 with 4 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 4 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 89/111 places, 120/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 7 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 104 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 104 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 98 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 98 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 94 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 94 transition count 125
Applied a total of 34 rules in 5 ms. Remains 94 /111 variables (removed 17) and now considering 125/142 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 94/111 places, 125/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 98 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 98 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 94 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 94 transition count 125
Applied a total of 34 rules in 4 ms. Remains 94 /111 variables (removed 17) and now considering 125/142 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 94/111 places, 125/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 97 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 97 transition count 128
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 91 transition count 122
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 91 transition count 122
Applied a total of 40 rules in 4 ms. Remains 91 /111 variables (removed 20) and now considering 122/142 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 91/111 places, 122/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 103 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 103 transition count 134
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 24 place count 95 transition count 126
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 95 transition count 126
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 89 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 89 transition count 120
Applied a total of 44 rules in 5 ms. Remains 89 /111 variables (removed 22) and now considering 120/142 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 89/111 places, 120/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 103 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 103 transition count 123
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 92 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 32 place count 83 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 41 place count 83 transition count 114
Applied a total of 41 rules in 12 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 4 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 91 transition count 122
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 91 transition count 122
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 48 place count 83 transition count 114
Iterating global reduction 0 with 8 rules applied. Total rules applied 56 place count 83 transition count 114
Applied a total of 56 rules in 4 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 10 Pre rules applied. Total rules applied 1 place count 102 transition count 123
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 92 transition count 123
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 30 place count 83 transition count 114
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 83 transition count 114
Applied a total of 39 rules in 9 ms. Remains 83 /111 variables (removed 28) and now considering 114/142 (removed 28) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 83/111 places, 114/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 698 steps (3 resets) in 14 ms. (46 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-11a-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 87 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 87 transition count 118
Applied a total of 48 rules in 3 ms. Remains 87 /111 variables (removed 24) and now considering 118/142 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 87/111 places, 118/142 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:59:56] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:59:56] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 21:59:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 142 transitions and 452 arcs took 1 ms.
Total runtime 8090 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 : DiscoveryGPU-PT-11a-CTLFireability-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-04
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-11a-CTLFireability-2023-15

BK_STOP 1717192796796

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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 DiscoveryGPU-PT-11a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/504/ctl_0_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/504/ctl_1_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/504/ctl_2_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/504/ctl_3_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/504/ctl_4_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/504/ctl_5_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/504/ctl_6_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/504/ctl_7_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/504/ctl_8_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/504/ctl_9_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/504/ctl_10_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/504/ctl_11_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/504/ctl_12_
ctl formula name DiscoveryGPU-PT-11a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/504/ctl_13_
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="DiscoveryGPU-PT-11a"
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 DiscoveryGPU-PT-11a, 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 r488-tall-171631132700442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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