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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 02:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 12 02:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 02:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 02:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 39K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-00
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-01
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-02
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-03
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-04
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-05
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-06
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-07
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-08
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-09
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-10
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2024-11
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2023-12
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2023-13
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2023-14
FORMULA_NAME DiscoveryGPU-PT-11a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716364797100

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-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:59:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 07:59:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:59:58] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-22 07:59:58] [INFO ] Transformed 113 places.
[2024-05-22 07:59:58] [INFO ] Transformed 155 transitions.
[2024-05-22 07:59:58] [INFO ] Found NUPN structural information;
[2024-05-22 07:59:58] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 209 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 153
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 153
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 15 place count 111 transition count 142
Applied a total of 15 rules in 33 ms. Remains 111 /113 variables (removed 2) and now considering 142/155 (removed 13) transitions.
// Phase 1: matrix 142 rows 111 cols
[2024-05-22 07:59:58] [INFO ] Computed 2 invariants in 11 ms
[2024-05-22 07:59:58] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 07:59:58] [INFO ] Invariant cache hit.
[2024-05-22 07:59:59] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-05-22 07:59:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 141 sub problems to find dead transitions.
[2024-05-22 07:59:59] [INFO ] Invariant cache hit.
[2024-05-22 07:59:59] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 201 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3846 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/111 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 142/253 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 88/201 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 141/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 7 (OVERLAPS) 0/253 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 342 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6734ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6755ms
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 142/155 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7165 ms. Remains : 111/113 places, 142/155 transitions.
Support contains 80 out of 111 places after structural reductions.
[2024-05-22 08:00:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 08:00:06] [INFO ] Flatten gal took : 65 ms
[2024-05-22 08:00:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 08:00:06] [INFO ] Flatten gal took : 23 ms
[2024-05-22 08:00:06] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 62 out of 111 places (down from 80) after GAL structural reductions.
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (338 resets) in 1692 ms. (23 steps per ms) remains 3/37 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (29 resets) in 149 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
[2024-05-22 08:00:07] [INFO ] Invariant cache hit.
[2024-05-22 08:00:07] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/42 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 17/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 6 (OVERLAPS) 48/90 variables, 25/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 18/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 49/139 variables, 19/95 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 16/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 36/175 variables, 17/128 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 14/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 15 (OVERLAPS) 24/199 variables, 12/154 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/199 variables, 8/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/199 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 20/219 variables, 8/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/219 variables, 6/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/219 variables, 0/176 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 16/235 variables, 7/183 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/235 variables, 5/188 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/235 variables, 0/188 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 6/241 variables, 3/191 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/241 variables, 2/193 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/241 variables, 0/193 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 4/245 variables, 2/195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/245 variables, 0/195 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 4/249 variables, 2/197 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/249 variables, 2/199 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/249 variables, 0/199 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 4/253 variables, 2/201 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/253 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 0/253 variables, 0/201 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 201 constraints, problems are : Problem set: 2 solved, 1 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 111/111 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 18/25 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 11/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 18/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/36 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Problem AtomicPropp30 is UNSAT
After SMT solving in domain Int declared 91/253 variables, and 58 constraints, problems are : Problem set: 3 solved, 0 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 40/111 constraints, ReadFeed: 18/88 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 299ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
[2024-05-22 08:00:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 8 ms
FORMULA DiscoveryGPU-PT-11a-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 45 out of 111 places (down from 51) after GAL structural reductions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 79 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Graph (trivial) has 83 edges and 79 vertex of which 40 / 79 are part of one of the 20 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 59 transition count 102
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 46 place count 49 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 48 transition count 81
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 56 place count 39 transition count 63
Iterating global reduction 3 with 9 rules applied. Total rules applied 65 place count 39 transition count 63
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 74 place count 30 transition count 45
Iterating global reduction 3 with 9 rules applied. Total rules applied 83 place count 30 transition count 45
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 90 place count 23 transition count 31
Iterating global reduction 3 with 7 rules applied. Total rules applied 97 place count 23 transition count 31
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 104 place count 16 transition count 24
Iterating global reduction 3 with 7 rules applied. Total rules applied 111 place count 16 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 16 transition count 23
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 114 place count 15 transition count 22
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 15 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 14 transition count 21
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 14 transition count 21
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 11 transition count 18
Applied a total of 120 rules in 29 ms. Remains 11 /111 variables (removed 100) and now considering 18/142 (removed 124) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 11/111 places, 18/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 0 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 10 ms. Remains 86 /111 variables (removed 25) and now considering 117/142 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 86/111 places, 117/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 92 transition count 123
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 92 transition count 123
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 85 transition count 116
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 85 transition count 116
Applied a total of 52 rules in 10 ms. Remains 85 /111 variables (removed 26) and now considering 116/142 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 85/111 places, 116/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 93 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 9 ms. Remains 86 /111 variables (removed 25) and now considering 117/142 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 86/111 places, 117/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 94 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 94 transition count 125
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 88 transition count 119
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 88 transition count 119
Applied a total of 46 rules in 10 ms. Remains 88 /111 variables (removed 23) and now considering 119/142 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 88/111 places, 119/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 7 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 119 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 1 place count 102 transition count 122
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 91 transition count 122
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 33 place count 81 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 43 place count 81 transition count 112
Applied a total of 43 rules in 12 ms. Remains 81 /111 variables (removed 30) and now considering 112/142 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 81/111 places, 112/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 101 transition count 132
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 101 transition count 132
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 93 transition count 124
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 43 place count 86 transition count 117
Iterating global reduction 0 with 7 rules applied. Total rules applied 50 place count 86 transition count 117
Applied a total of 50 rules in 5 ms. Remains 86 /111 variables (removed 25) and now considering 117/142 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 86/111 places, 117/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 133
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 94 transition count 125
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 94 transition count 125
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 41 place count 87 transition count 118
Iterating global reduction 0 with 7 rules applied. Total rules applied 48 place count 87 transition count 118
Applied a total of 48 rules in 4 ms. Remains 87 /111 variables (removed 24) and now considering 118/142 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 87/111 places, 118/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Graph (complete) has 310 edges and 111 vertex of which 102 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 110 edges and 99 vertex of which 77 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Graph (trivial) has 78 edges and 77 vertex of which 36 / 77 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 59 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 44 place count 49 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 48 transition count 81
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 53 place count 40 transition count 65
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 40 transition count 65
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 68 place count 33 transition count 51
Iterating global reduction 3 with 7 rules applied. Total rules applied 75 place count 33 transition count 51
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 27 transition count 39
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 27 transition count 39
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 93 place count 21 transition count 33
Iterating global reduction 3 with 6 rules applied. Total rules applied 99 place count 21 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 21 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 20 transition count 31
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 107 place count 15 transition count 26
Applied a total of 107 rules in 9 ms. Remains 15 /111 variables (removed 96) and now considering 26/142 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 15/111 places, 26/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 1 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 0 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 102 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 102 transition count 133
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 27 place count 93 transition count 124
Iterating global reduction 0 with 9 rules applied. Total rules applied 36 place count 93 transition count 124
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 87 transition count 118
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 87 transition count 118
Applied a total of 48 rules in 4 ms. Remains 87 /111 variables (removed 24) and now considering 118/142 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 87/111 places, 118/142 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 08:00:07] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 08:00:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 08:00:07] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 08:00:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 142 transitions and 452 arcs took 2 ms.
Total runtime 9409 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-11a

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/408/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: 541
MODEL NAME: /home/mcc/execution/408/model
111 places, 142 transitions.

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

BK_STOP 1716365418351

--------------------
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-11a"
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-11a, 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-171631131100441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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