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

About the Execution of GreatSPN+red for DiscoveryGPU-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7760.159 3600000.00 9085502.00 8747.00 TTTFFTTTFTFTF?T? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131100457.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 greatspnxred
Input is DiscoveryGPU-PT-12a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131100457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 02:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 02:00 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 43K 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-12a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-12a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716367332189

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-12a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:42:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 08:42:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:42:13] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-22 08:42:13] [INFO ] Transformed 123 places.
[2024-05-22 08:42:13] [INFO ] Transformed 169 transitions.
[2024-05-22 08:42:13] [INFO ] Found NUPN structural information;
[2024-05-22 08:42:13] [INFO ] Parsed PT model containing 123 places and 169 transitions and 543 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 120 transition count 166
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 120 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 18 place count 120 transition count 154
Applied a total of 18 rules in 27 ms. Remains 120 /123 variables (removed 3) and now considering 154/169 (removed 15) transitions.
// Phase 1: matrix 154 rows 120 cols
[2024-05-22 08:42:13] [INFO ] Computed 2 invariants in 12 ms
[2024-05-22 08:42:13] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 08:42:13] [INFO ] Invariant cache hit.
[2024-05-22 08:42:13] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-22 08:42:13] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [118]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 419 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 119/123 places, 154/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 119 /119 variables (removed 0) and now considering 154/154 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 470 ms. Remains : 119/123 places, 154/169 transitions.
Support contains 78 out of 119 places after structural reductions.
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 28 ms
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 11 ms
[2024-05-22 08:42:14] [INFO ] Input system was already deterministic with 154 transitions.
Support contains 73 out of 119 places (down from 78) after GAL structural reductions.
RANDOM walk for 40000 steps (313 resets) in 1266 ms. (31 steps per ms) remains 1/59 properties
BEST_FIRST walk for 40004 steps (23 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
// Phase 1: matrix 154 rows 119 cols
[2024-05-22 08:42:14] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:42:14] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/44 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/88 variables, 16/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/88 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 27/115 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/115 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/115 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 22/137 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/137 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 32/169 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/169 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 30/199 variables, 10/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/199 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 20/219 variables, 10/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/219 variables, 10/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/219 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 20/239 variables, 10/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/239 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 20/259 variables, 10/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/259 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 14/273 variables, 7/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/273 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/273 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 144 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 119/119 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/11 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/44 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 44/273 variables, and 23 constraints, problems are : Problem set: 1 solved, 0 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/119 constraints, ReadFeed: 2/24 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 215ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 13 ms
[2024-05-22 08:42:14] [INFO ] Input system was already deterministic with 154 transitions.
Computed a total of 14 stabilizing places and 13 stable transitions
Graph (complete) has 194 edges and 119 vertex of which 86 are kept as prefixes of interest. Removing 33 places using SCC suffix rule.3 ms
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 110 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 110 transition count 145
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 102 transition count 137
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 102 transition count 137
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 96 transition count 131
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 96 transition count 131
Applied a total of 46 rules in 14 ms. Remains 96 /119 variables (removed 23) and now considering 131/154 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 96/119 places, 131/154 transitions.
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:14] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 108 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 108 transition count 143
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 97 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 97 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 89 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 89 transition count 124
Applied a total of 60 rules in 12 ms. Remains 89 /119 variables (removed 30) and now considering 124/154 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 89/119 places, 124/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 107 edges and 119 vertex of which 48 / 119 are part of one of the 24 SCC in 2 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 170 edges and 95 vertex of which 63 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 32 output transitions
Drop transitions (Output transitions of discarded places.) removed 32 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 61 transition count 85
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 49 transition count 85
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 39 transition count 65
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 39 transition count 65
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 29 transition count 45
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 29 transition count 45
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 19 transition count 25
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 19 transition count 25
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 9 transition count 15
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 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 108 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 109 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 110 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 112 place count 6 transition count 11
Applied a total of 112 rules in 27 ms. Remains 6 /119 variables (removed 113) and now considering 11/154 (removed 143) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 6/119 places, 11/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 11 transitions.
RANDOM walk for 334 steps (11 resets) in 5 ms. (55 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 102 edges and 119 vertex of which 46 / 119 are part of one of the 23 SCC in 0 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 171 edges and 96 vertex of which 66 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 12 rules applied. Total rules applied 14 place count 64 transition count 89
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 25 place count 53 transition count 89
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 45 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 45 transition count 73
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 49 place count 37 transition count 57
Iterating global reduction 2 with 8 rules applied. Total rules applied 57 place count 37 transition count 57
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 30 transition count 43
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 30 transition count 43
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 78 place count 23 transition count 36
Iterating global reduction 2 with 7 rules applied. Total rules applied 85 place count 23 transition count 36
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 23 transition count 35
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 2 with 2 rules applied. Total rules applied 88 place count 22 transition count 34
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 93 place count 17 transition count 29
Applied a total of 93 rules in 16 ms. Remains 17 /119 variables (removed 102) and now considering 29/154 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 17/119 places, 29/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 106 edges and 119 vertex of which 48 / 119 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Graph (complete) has 170 edges and 95 vertex of which 64 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 62 transition count 86
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 27 place count 50 transition count 86
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 37 place count 40 transition count 66
Iterating global reduction 2 with 10 rules applied. Total rules applied 47 place count 40 transition count 66
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 57 place count 30 transition count 46
Iterating global reduction 2 with 10 rules applied. Total rules applied 67 place count 30 transition count 46
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 20 transition count 26
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 20 transition count 26
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 97 place count 10 transition count 16
Iterating global reduction 2 with 10 rules applied. Total rules applied 107 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 108 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 109 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 110 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 112 place count 7 transition count 12
Applied a total of 112 rules in 12 ms. Remains 7 /119 variables (removed 112) and now considering 12/154 (removed 142) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 7/119 places, 12/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 108 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 108 transition count 143
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 97 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 97 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 89 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 89 transition count 124
Applied a total of 60 rules in 6 ms. Remains 89 /119 variables (removed 30) and now considering 124/154 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 89/119 places, 124/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 110 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 110 transition count 145
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 104 transition count 139
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 104 transition count 139
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 100 transition count 135
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 135
Applied a total of 38 rules in 6 ms. Remains 100 /119 variables (removed 19) and now considering 135/154 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 100/119 places, 135/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 108 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 108 transition count 143
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 32 place count 98 transition count 133
Iterating global reduction 0 with 10 rules applied. Total rules applied 42 place count 98 transition count 133
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 91 transition count 126
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 91 transition count 126
Applied a total of 56 rules in 6 ms. Remains 91 /119 variables (removed 28) and now considering 126/154 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 91/119 places, 126/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 90 edges and 119 vertex of which 42 / 119 are part of one of the 21 SCC in 0 ms
Free SCC test removed 21 places
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 173 edges and 98 vertex of which 67 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 31 output transitions
Drop transitions (Output transitions of discarded places.) removed 31 transitions
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 2 place count 67 transition count 93
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 20 place count 58 transition count 93
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 49 transition count 75
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 49 transition count 75
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 42 transition count 61
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 42 transition count 61
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 37 transition count 51
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 37 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 33 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 33 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
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 80 place count 28 transition count 42
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 28 transition count 42
Applied a total of 82 rules in 13 ms. Remains 28 /119 variables (removed 91) and now considering 42/154 (removed 112) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 28/119 places, 42/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 110 transition count 145
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 110 transition count 145
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 102 transition count 137
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 102 transition count 137
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 97 transition count 132
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 97 transition count 132
Applied a total of 44 rules in 6 ms. Remains 97 /119 variables (removed 22) and now considering 132/154 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 97/119 places, 132/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Graph (trivial) has 104 edges and 119 vertex of which 46 / 119 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Graph (complete) has 171 edges and 96 vertex of which 66 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 64 transition count 87
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 29 place count 51 transition count 87
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 39 place count 41 transition count 67
Iterating global reduction 2 with 10 rules applied. Total rules applied 49 place count 41 transition count 67
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 59 place count 31 transition count 47
Iterating global reduction 2 with 10 rules applied. Total rules applied 69 place count 31 transition count 47
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 78 place count 22 transition count 29
Iterating global reduction 2 with 9 rules applied. Total rules applied 87 place count 22 transition count 29
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 96 place count 13 transition count 20
Iterating global reduction 2 with 9 rules applied. Total rules applied 105 place count 13 transition count 20
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 106 place count 13 transition count 19
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 2 with 2 rules applied. Total rules applied 108 place count 12 transition count 18
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 11 transition count 17
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 11 transition count 17
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 9 transition count 15
Applied a total of 113 rules in 11 ms. Remains 9 /119 variables (removed 110) and now considering 15/154 (removed 139) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 9/119 places, 15/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 0 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 0 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 15 transitions.
RANDOM walk for 125 steps (1 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 108 transition count 143
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 108 transition count 143
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 33 place count 97 transition count 132
Iterating global reduction 0 with 11 rules applied. Total rules applied 44 place count 97 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 89 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 89 transition count 124
Applied a total of 60 rules in 5 ms. Remains 89 /119 variables (removed 30) and now considering 124/154 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 89/119 places, 124/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 3 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 144
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 100 transition count 135
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 100 transition count 135
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 94 transition count 129
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 94 transition count 129
Applied a total of 50 rules in 4 ms. Remains 94 /119 variables (removed 25) and now considering 129/154 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 94/119 places, 129/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 109 transition count 144
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 109 transition count 144
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 99 transition count 134
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 99 transition count 134
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 92 transition count 127
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 92 transition count 127
Applied a total of 54 rules in 4 ms. Remains 92 /119 variables (removed 27) and now considering 127/154 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 92/119 places, 127/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 154/154 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 111 transition count 146
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 111 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 104 transition count 139
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 104 transition count 139
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 99 transition count 134
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 99 transition count 134
Applied a total of 40 rules in 4 ms. Remains 99 /119 variables (removed 20) and now considering 134/154 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/119 places, 134/154 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:42:15] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:42:15] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-22 08:42:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 119 places, 154 transitions and 347 arcs took 3 ms.
Total runtime 2182 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-12a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 119
TRANSITIONS: 154
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.004s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 535
MODEL NAME: /home/mcc/execution/415/model
119 places, 154 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-12a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

--------------------
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

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-12a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is DiscoveryGPU-PT-12a, 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 r135-tall-171631131100457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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