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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.7K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Apr 12 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 12 01:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 01:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:40 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 22K 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-06a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717191769135

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:42:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 21:42:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:42:50] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-31 21:42:50] [INFO ] Transformed 63 places.
[2024-05-31 21:42:50] [INFO ] Transformed 85 transitions.
[2024-05-31 21:42:50] [INFO ] Found NUPN structural information;
[2024-05-31 21:42:50] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 54 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 62 transition count 78
Applied a total of 8 rules in 28 ms. Remains 62 /63 variables (removed 1) and now considering 78/85 (removed 7) transitions.
// Phase 1: matrix 78 rows 62 cols
[2024-05-31 21:42:50] [INFO ] Computed 2 invariants in 6 ms
[2024-05-31 21:42:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-31 21:42:50] [INFO ] Invariant cache hit.
[2024-05-31 21:42:50] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-31 21:42:50] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2024-05-31 21:42:50] [INFO ] Invariant cache hit.
[2024-05-31 21:42:50] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 0/140 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 112 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 78/140 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 48/112 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/140 variables, 77/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/140 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 189 constraints, problems are : Problem set: 0 solved, 77 unsolved in 985 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2369ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2389ms
Starting structural reductions in LTL mode, iteration 1 : 62/63 places, 78/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2682 ms. Remains : 62/63 places, 78/85 transitions.
Support contains 54 out of 62 places after structural reductions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 22 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 13 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 19563 steps (302 resets) in 390 ms. (50 steps per ms) remains 0/59 properties
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 5 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 6 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 78 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 5 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/62 places, 65/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 58 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 57 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 57 transition count 73
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 73/78 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/62 places, 73/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 73 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 46 edges and 43 vertex of which 24 / 43 are part of one of the 12 SCC in 1 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 31 transition count 56
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 27 place count 26 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 31 place count 22 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 35 place count 22 transition count 36
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 38 place count 19 transition count 30
Iterating global reduction 2 with 3 rules applied. Total rules applied 41 place count 19 transition count 30
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 44 place count 16 transition count 24
Iterating global reduction 2 with 3 rules applied. Total rules applied 47 place count 16 transition count 24
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 13 transition count 21
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 13 transition count 21
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 13 transition count 19
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 56 place count 13 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 12 transition count 18
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 60 place count 9 transition count 15
Applied a total of 60 rules in 22 ms. Remains 9 /62 variables (removed 53) and now considering 15/78 (removed 63) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 9/62 places, 15/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 54 transition count 70
Applied a total of 16 rules in 4 ms. Remains 54 /62 variables (removed 8) and now considering 70/78 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/62 places, 70/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 44 edges and 43 vertex of which 22 / 43 are part of one of the 11 SCC in 0 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 32 transition count 56
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 26 place count 27 transition count 45
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 23 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 23 transition count 37
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 19 transition count 29
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 19 transition count 29
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 15 transition count 21
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 15 transition count 21
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 11 transition count 17
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 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 2 with 1 rules applied. Total rules applied 59 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 2 with 1 rules applied. Total rules applied 60 place count 11 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 10 transition count 15
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 8 transition count 13
Applied a total of 63 rules in 6 ms. Remains 8 /62 variables (removed 54) and now considering 13/78 (removed 65) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 8/62 places, 13/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 3 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 48/62 places, 64/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 2 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 56 transition count 72
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 3 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/62 places, 71/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 74
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 51 transition count 67
Applied a total of 22 rules in 3 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 51/62 places, 67/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 2 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 53 transition count 69
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 49 transition count 65
Applied a total of 26 rules in 4 ms. Remains 49 /62 variables (removed 13) and now considering 65/78 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 49/62 places, 65/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 56 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 55 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 55 transition count 71
Applied a total of 14 rules in 3 ms. Remains 55 /62 variables (removed 7) and now considering 71/78 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/62 places, 71/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 1 place count 57 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 52 transition count 68
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 16 place count 47 transition count 63
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 47 transition count 63
Applied a total of 21 rules in 7 ms. Remains 47 /62 variables (removed 15) and now considering 63/78 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 47/62 places, 63/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 2 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 63 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 43 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Graph (trivial) has 43 edges and 43 vertex of which 20 / 43 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 33 transition count 55
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 27 place count 27 transition count 45
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 24 transition count 39
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 24 transition count 39
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 22 transition count 35
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 22 transition count 35
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 20 transition count 31
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 20 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 43 place count 18 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 18 transition count 29
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 46 place count 18 transition count 28
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 47 place count 18 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 17 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 52 place count 13 transition count 23
Applied a total of 52 rules in 6 ms. Remains 13 /62 variables (removed 49) and now considering 23/78 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 13/62 places, 23/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 73
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 52 transition count 68
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 48 transition count 64
Applied a total of 28 rules in 6 ms. Remains 48 /62 variables (removed 14) and now considering 64/78 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 48/62 places, 64/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 2 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 58 transition count 70
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 51 transition count 67
Applied a total of 15 rules in 5 ms. Remains 51 /62 variables (removed 11) and now considering 67/78 (removed 11) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 51/62 places, 67/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 3 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 57 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 60 edges and 54 vertex of which 42 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Graph (trivial) has 44 edges and 42 vertex of which 22 / 42 are part of one of the 11 SCC in 1 ms
Free SCC test removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 31 transition count 55
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 26 place count 26 transition count 44
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 22 transition count 36
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 22 transition count 36
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 38 place count 18 transition count 28
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 18 transition count 28
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 46 place count 14 transition count 20
Iterating global reduction 2 with 4 rules applied. Total rules applied 50 place count 14 transition count 20
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 54 place count 10 transition count 16
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 10 transition count 16
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 59 place count 10 transition count 15
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 60 place count 10 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 61 place count 9 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 63 place count 7 transition count 12
Applied a total of 63 rules in 5 ms. Remains 7 /62 variables (removed 55) and now considering 12/78 (removed 66) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 7/62 places, 12/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 78/78 transitions.
Graph (complete) has 171 edges and 62 vertex of which 58 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 61 edges and 55 vertex of which 46 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
Graph (trivial) has 48 edges and 46 vertex of which 24 / 46 are part of one of the 12 SCC in 0 ms
Free SCC test removed 12 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 34 transition count 58
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 29 place count 28 transition count 46
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 32 place count 25 transition count 40
Iterating global reduction 2 with 3 rules applied. Total rules applied 35 place count 25 transition count 40
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 37 place count 23 transition count 36
Iterating global reduction 2 with 2 rules applied. Total rules applied 39 place count 23 transition count 36
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 41 place count 21 transition count 32
Iterating global reduction 2 with 2 rules applied. Total rules applied 43 place count 21 transition count 32
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 19 transition count 30
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 19 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 19 transition count 28
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 50 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 18 transition count 27
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 14 transition count 23
Applied a total of 55 rules in 5 ms. Remains 14 /62 variables (removed 48) and now considering 23/78 (removed 55) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 14/62 places, 23/78 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 1 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 0 ms
[2024-05-31 21:42:53] [INFO ] Input system was already deterministic with 23 transitions.
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:42:53] [INFO ] Flatten gal took : 4 ms
[2024-05-31 21:42:53] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 21:42:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 78 transitions and 248 arcs took 4 ms.
Total runtime 3704 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-06a-CTLCardinality-2024-00
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-04
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2024-11
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2023-14
Could not compute solution for formula : DiscoveryGPU-PT-06a-CTLCardinality-2023-15

BK_STOP 1717191774337

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/504/ctl_0_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/504/ctl_1_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/504/ctl_2_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/504/ctl_3_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/504/ctl_4_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/504/ctl_5_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/504/ctl_6_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/504/ctl_7_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/504/ctl_8_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/504/ctl_9_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/504/ctl_10_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/504/ctl_11_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/504/ctl_12_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/504/ctl_13_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/504/ctl_14_
ctl formula name DiscoveryGPU-PT-06a-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/504/ctl_15_
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-06a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DiscoveryGPU-PT-06a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132500361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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