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-171631132600394.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-08a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132600394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K 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 25K 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 18K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 12 01:43 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 28K 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-08a-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-08a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717192253008

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-08a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:50:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:50:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:50:54] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-31 21:50:54] [INFO ] Transformed 83 places.
[2024-05-31 21:50:54] [INFO ] Transformed 113 transitions.
[2024-05-31 21:50:54] [INFO ] Found NUPN structural information;
[2024-05-31 21:50:54] [INFO ] Parsed PT model containing 83 places and 113 transitions and 363 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 67 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 113/113 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 105
Applied a total of 8 rules in 19 ms. Remains 83 /83 variables (removed 0) and now considering 105/113 (removed 8) transitions.
// Phase 1: matrix 105 rows 83 cols
[2024-05-31 21:50:54] [INFO ] Computed 2 invariants in 9 ms
[2024-05-31 21:50:54] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-31 21:50:54] [INFO ] Invariant cache hit.
[2024-05-31 21:50:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-31 21:50:54] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2024-05-31 21:50:54] [INFO ] Invariant cache hit.
[2024-05-31 21:50:54] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/188 variables, 83/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 64/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/188 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 232 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2259 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/188 variables, 83/168 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 64/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 104/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 336 constraints, problems are : Problem set: 0 solved, 104 unsolved in 1601 ms.
Refiners :[Domain max(s): 83/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 0/0 constraints]
After SMT, in 3915ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 3926ms
Starting structural reductions in LTL mode, iteration 1 : 83/83 places, 105/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4323 ms. Remains : 83/83 places, 105/113 transitions.
Support contains 67 out of 83 places after structural reductions.
[2024-05-31 21:50:58] [INFO ] Flatten gal took : 26 ms
[2024-05-31 21:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:50:58] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 66 out of 83 places (down from 67) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 87 to 84
RANDOM walk for 40000 steps (458 resets) in 1360 ms. (29 steps per ms) remains 4/84 properties
BEST_FIRST walk for 40003 steps (62 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 52 ms. (754 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (53 resets) in 55 ms. (714 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (11 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
[2024-05-31 21:50:59] [INFO ] Invariant cache hit.
[2024-05-31 21:50:59] [INFO ] State equation strengthened by 64 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/36 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 15/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 6 (OVERLAPS) 45/81 variables, 22/63 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 22/85 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 18/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/103 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 10 (OVERLAPS) 40/121 variables, 17/120 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/121 variables, 17/137 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/121 variables, 12/149 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp18 is UNSAT
After SMT solving in domain Real declared 138/188 variables, and 158 constraints, problems are : Problem set: 4 solved, 0 unsolved in 71 ms.
Refiners :[Domain max(s): 51/83 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 60/83 constraints, ReadFeed: 45/64 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 105 transitions.
Support contains 61 out of 83 places (down from 62) after GAL structural reductions.
Computed a total of 11 stabilizing places and 9 stable transitions
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 79 transition count 101
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 79 transition count 101
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 75 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 75 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 73 transition count 95
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 73 transition count 95
Applied a total of 20 rules in 8 ms. Remains 73 /83 variables (removed 10) and now considering 95/105 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 73/83 places, 95/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 64 transition count 86
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 64 transition count 86
Applied a total of 38 rules in 6 ms. Remains 64 /83 variables (removed 19) and now considering 86/105 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 64/83 places, 86/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 86 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 75 transition count 91
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 19 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 25 place count 63 transition count 85
Applied a total of 25 rules in 19 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 63/83 places, 85/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 65 transition count 87
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 65 transition count 87
Applied a total of 36 rules in 5 ms. Remains 65 /83 variables (removed 18) and now considering 87/105 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 65/83 places, 87/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 57 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 64 edges and 57 vertex of which 32 / 57 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 41 transition count 73
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 37 place count 33 transition count 57
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 43 place count 27 transition count 45
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 27 transition count 45
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 55 place count 21 transition count 33
Iterating global reduction 2 with 6 rules applied. Total rules applied 61 place count 21 transition count 33
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 67 place count 15 transition count 21
Iterating global reduction 2 with 6 rules applied. Total rules applied 73 place count 15 transition count 21
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 9 transition count 15
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 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 86 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 87 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 88 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 90 place count 6 transition count 11
Applied a total of 90 rules in 14 ms. Remains 6 /83 variables (removed 77) and now considering 11/105 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 6/83 places, 11/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 147 steps (5 resets) in 4 ms. (29 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-08a-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 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 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 75 transition count 90
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 68 transition count 90
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 22 place count 61 transition count 83
Iterating global reduction 0 with 7 rules applied. Total rules applied 29 place count 61 transition count 83
Applied a total of 29 rules in 7 ms. Remains 61 /83 variables (removed 22) and now considering 83/105 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 61/83 places, 83/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 57 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Graph (trivial) has 59 edges and 57 vertex of which 28 / 57 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 43 transition count 74
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 34 place count 36 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 35 transition count 59
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 41 place count 29 transition count 47
Iterating global reduction 3 with 6 rules applied. Total rules applied 47 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 53 place count 23 transition count 35
Iterating global reduction 3 with 6 rules applied. Total rules applied 59 place count 23 transition count 35
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 65 place count 17 transition count 23
Iterating global reduction 3 with 6 rules applied. Total rules applied 71 place count 17 transition count 23
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 77 place count 11 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 83 place count 11 transition count 17
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 11 transition count 16
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 3 with 1 rules applied. Total rules applied 85 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 8 transition count 13
Applied a total of 88 rules in 7 ms. Remains 8 /83 variables (removed 75) and now considering 13/105 (removed 92) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 8/83 places, 13/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 73 transition count 95
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 73 transition count 95
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 71 transition count 93
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 71 transition count 93
Applied a total of 24 rules in 4 ms. Remains 71 /83 variables (removed 12) and now considering 93/105 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 71/83 places, 93/105 transitions.
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:50:59] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:50:59] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 6 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 63/83 places, 85/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 5 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 63/83 places, 85/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 69 transition count 91
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 69 transition count 91
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 63 transition count 85
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 63 transition count 85
Applied a total of 40 rules in 5 ms. Remains 63 /83 variables (removed 20) and now considering 85/105 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 63/83 places, 85/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 76 transition count 98
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 76 transition count 98
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 20 place count 70 transition count 92
Iterating global reduction 0 with 6 rules applied. Total rules applied 26 place count 70 transition count 92
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 66 transition count 88
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 66 transition count 88
Applied a total of 34 rules in 4 ms. Remains 66 /83 variables (removed 17) and now considering 88/105 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 66/83 places, 88/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 94
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 70 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 70 transition count 92
Applied a total of 26 rules in 4 ms. Remains 70 /83 variables (removed 13) and now considering 92/105 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 70/83 places, 92/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Graph (complete) has 228 edges and 83 vertex of which 75 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 80 edges and 72 vertex of which 56 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Graph (trivial) has 61 edges and 56 vertex of which 30 / 56 are part of one of the 15 SCC in 0 ms
Free SCC test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 41 transition count 73
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 35 place count 34 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 33 transition count 57
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 43 place count 26 transition count 43
Iterating global reduction 3 with 7 rules applied. Total rules applied 50 place count 26 transition count 43
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 19 transition count 29
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 19 transition count 29
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 70 place count 13 transition count 17
Iterating global reduction 3 with 6 rules applied. Total rules applied 76 place count 13 transition count 17
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 7 transition count 11
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 7 transition count 11
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 4 transition count 7
Applied a total of 93 rules in 6 ms. Remains 4 /83 variables (removed 79) and now considering 7/105 (removed 98) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 4/83 places, 7/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 71 transition count 93
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 71 transition count 93
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 66 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 66 transition count 88
Applied a total of 34 rules in 2 ms. Remains 66 /83 variables (removed 17) and now considering 88/105 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/83 places, 88/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 105/105 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 77 transition count 99
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 77 transition count 99
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 72 transition count 94
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 72 transition count 94
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 67 transition count 89
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 67 transition count 89
Applied a total of 32 rules in 3 ms. Remains 67 /83 variables (removed 16) and now considering 89/105 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/83 places, 89/105 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:51:00] [INFO ] Input system was already deterministic with 89 transitions.
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:51:00] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:51:00] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 21:51:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 105 transitions and 331 arcs took 2 ms.
Total runtime 6074 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-08a-CTLFireability-2024-00
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2023-14
Could not compute solution for formula : DiscoveryGPU-PT-08a-CTLFireability-2023-15

BK_STOP 1717192260625

--------------------
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 DiscoveryGPU-PT-08a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/499/ctl_0_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/499/ctl_1_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/499/ctl_2_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/499/ctl_3_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/499/ctl_4_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/499/ctl_5_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/499/ctl_6_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/499/ctl_7_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/499/ctl_8_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/499/ctl_9_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/499/ctl_10_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/499/ctl_11_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/499/ctl_12_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/499/ctl_13_
ctl formula name DiscoveryGPU-PT-08a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/499/ctl_14_
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-08a"
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-08a, 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-171631132600394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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