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

--------------------
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-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-06a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716359839202

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 06:37:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 06:37:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 06:37:20] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2024-05-22 06:37:20] [INFO ] Transformed 63 places.
[2024-05-22 06:37:20] [INFO ] Transformed 85 transitions.
[2024-05-22 06:37:20] [INFO ] Found NUPN structural information;
[2024-05-22 06:37:20] [INFO ] Parsed PT model containing 63 places and 85 transitions and 273 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 85/85 transitions.
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 6 place count 63 transition count 79
Applied a total of 6 rules in 18 ms. Remains 63 /63 variables (removed 0) and now considering 79/85 (removed 6) transitions.
// Phase 1: matrix 79 rows 63 cols
[2024-05-22 06:37:20] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 06:37:20] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 06:37:20] [INFO ] Invariant cache hit.
[2024-05-22 06:37:20] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-22 06:37:20] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-22 06:37:21] [INFO ] Invariant cache hit.
[2024-05-22 06:37:21] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/142 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 48/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 176 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1415 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 79/142 variables, 63/128 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 48/176 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 78/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 254 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1090 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 2564ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2579ms
Starting structural reductions in LTL mode, iteration 1 : 63/63 places, 79/85 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2950 ms. Remains : 63/63 places, 79/85 transitions.
Support contains 53 out of 63 places after structural reductions.
[2024-05-22 06:37:23] [INFO ] Flatten gal took : 27 ms
[2024-05-22 06:37:23] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:37:23] [INFO ] Input system was already deterministic with 79 transitions.
Reduction of identical properties reduced properties to check from 78 to 72
RANDOM walk for 40000 steps (608 resets) in 1020 ms. (39 steps per ms) remains 1/72 properties
BEST_FIRST walk for 40003 steps (87 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
[2024-05-22 06:37:24] [INFO ] Invariant cache hit.
[2024-05-22 06:37:24] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 5/13 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/18 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/18 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/22 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/24 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/24 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/24 variables, 8/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Real declared 37/142 variables, and 36 constraints, problems are : Problem set: 1 solved, 0 unsolved in 43 ms.
Refiners :[Domain max(s): 10/63 constraints, Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 18/63 constraints, ReadFeed: 8/48 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 48ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 79 transitions.
Computed a total of 9 stabilizing places and 7 stable transitions
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 54 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 50 transition count 66
Applied a total of 26 rules in 8 ms. Remains 50 /63 variables (removed 13) and now considering 66/79 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 50/63 places, 66/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 60 transition count 76
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 60 transition count 76
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 57 transition count 73
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 57 transition count 73
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 55 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 55 transition count 71
Applied a total of 16 rules in 5 ms. Remains 55 /63 variables (removed 8) and now considering 71/79 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 55/63 places, 71/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 54 transition count 70
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 54 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 50 transition count 66
Applied a total of 26 rules in 4 ms. Remains 50 /63 variables (removed 13) and now considering 66/79 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 50/63 places, 66/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 54 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 54 transition count 70
Applied a total of 18 rules in 5 ms. Remains 54 /63 variables (removed 9) and now considering 70/79 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 54/63 places, 70/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 70 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 52 transition count 68
Applied a total of 22 rules in 4 ms. Remains 52 /63 variables (removed 11) and now considering 68/79 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 52/63 places, 68/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 58 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
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 58 transition count 68
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 52 transition count 68
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 17 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 21 place count 48 transition count 64
Applied a total of 21 rules in 18 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 48/63 places, 64/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 57 transition count 70
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 10 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 13 place count 51 transition count 67
Applied a total of 13 rules in 7 ms. Remains 51 /63 variables (removed 12) and now considering 67/79 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 51/63 places, 67/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 53 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 53 transition count 69
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 49 transition count 65
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 49 transition count 65
Applied a total of 28 rules in 5 ms. Remains 49 /63 variables (removed 14) and now considering 65/79 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 49/63 places, 65/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 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 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 15 place count 48 transition count 64
Iterating global reduction 0 with 4 rules applied. Total rules applied 19 place count 48 transition count 64
Applied a total of 19 rules in 7 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 48/63 places, 64/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Applied a total of 8 rules in 2 ms. Remains 59 /63 variables (removed 4) and now considering 75/79 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 59/63 places, 75/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 53 transition count 69
Applied a total of 20 rules in 4 ms. Remains 53 /63 variables (removed 10) and now considering 69/79 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 53/63 places, 69/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 55 transition count 71
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 51 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 51 transition count 67
Applied a total of 24 rules in 4 ms. Remains 51 /63 variables (removed 12) and now considering 67/79 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 51/63 places, 67/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 67 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 58 transition count 74
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 58 transition count 74
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 53 transition count 69
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 53 transition count 69
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 48 transition count 64
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 48 transition count 64
Applied a total of 30 rules in 3 ms. Remains 48 /63 variables (removed 15) and now considering 64/79 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 48/63 places, 64/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 59 transition count 75
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 59 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 53 transition count 69
Applied a total of 20 rules in 3 ms. Remains 53 /63 variables (removed 10) and now considering 69/79 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 53/63 places, 69/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 69 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 63/63 places, 79/79 transitions.
Graph (complete) has 172 edges and 63 vertex of which 57 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 57 transition count 67
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 51 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 46 transition count 62
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 46 transition count 62
Applied a total of 23 rules in 6 ms. Remains 46 /63 variables (removed 17) and now considering 62/79 (removed 17) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 46/63 places, 62/79 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 2 ms
[2024-05-22 06:37:24] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 06:37:24] [INFO ] Flatten gal took : 9 ms
[2024-05-22 06:37:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-22 06:37:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 79 transitions and 249 arcs took 3 ms.
Total runtime 4290 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-06a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/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: 536
MODEL NAME: /home/mcc/execution/411/model
63 places, 79 transitions.

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

BK_STOP 1716359846746

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML

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="CTLFireability"
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-06a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631130900362"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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