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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 17K 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 DoubleExponent-PT-001-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-001-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716375185130

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:53:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 10:53:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:53:06] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-22 10:53:06] [INFO ] Transformed 57 places.
[2024-05-22 10:53:06] [INFO ] Transformed 48 transitions.
[2024-05-22 10:53:06] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Applied a total of 0 rules in 10 ms. Remains 57 /57 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 57 cols
[2024-05-22 10:53:06] [INFO ] Computed 9 invariants in 11 ms
[2024-05-22 10:53:06] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 10:53:06] [INFO ] Invariant cache hit.
[2024-05-22 10:53:06] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 10:53:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 7 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 2 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 3/57 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:53:07] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 48/105 variables, 57/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/105 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 76 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1613 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/54 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:08] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 3/57 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 48/105 variables, 57/77 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/105 variables, 47/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/105 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (OVERLAPS) 0/105 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/105 variables, and 124 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1282 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 11/11 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2948ms
Finished structural reductions in LTL mode , in 1 iterations and 3294 ms. Remains : 57/57 places, 48/48 transitions.
Support contains 46 out of 57 places after structural reductions.
[2024-05-22 10:53:10] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:53:10] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:53:10] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1332 resets) in 1786 ms. (22 steps per ms) remains 10/51 properties
BEST_FIRST walk for 40001 steps (1162 resets) in 781 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1145 resets) in 450 ms. (88 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 258 ms. (154 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1121 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1480 resets) in 197 ms. (202 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1480 resets) in 220 ms. (180 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1117 resets) in 202 ms. (197 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1125 resets) in 157 ms. (253 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1150 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1128 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
[2024-05-22 10:53:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
At refinement iteration 1 (OVERLAPS) 36/52 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/57 variables, 5/9 constraints. Problems are: Problem set: 7 solved, 3 unsolved
[2024-05-22 10:53:11] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-22 10:53:11] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:53:11] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
After SMT solving in domain Real declared 57/105 variables, and 12 constraints, problems are : Problem set: 10 solved, 0 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 0/57 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 3/3 constraints]
After SMT, in 169ms problems are : Problem set: 10 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 10 atomic propositions for a total of 14 simplifications.
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:53:11] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:53:11] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 39 out of 57 places (down from 43) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 87 edges and 57 vertex of which 51 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 7 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 53/57 places, 48/48 transitions.
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:11] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 48
Applied a total of 3 rules in 2 ms. Remains 54 /57 variables (removed 3) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 54/57 places, 48/48 transitions.
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:53:11] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 52 transition count 39
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 44 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 44 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 42 transition count 37
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 36 transition count 31
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 34 place count 36 transition count 31
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 35 transition count 30
Applied a total of 35 rules in 18 ms. Remains 35 /57 variables (removed 22) and now considering 30/48 (removed 18) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 35/57 places, 30/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 48
Applied a total of 3 rules in 1 ms. Remains 54 /57 variables (removed 3) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 2 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 2 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 53 transition count 44
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 49 transition count 41
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 15 place count 46 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 15 place count 46 transition count 40
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 17 place count 45 transition count 40
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 3 with 10 rules applied. Total rules applied 27 place count 40 transition count 35
Applied a total of 27 rules in 7 ms. Remains 40 /57 variables (removed 17) and now considering 35/48 (removed 13) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 40/57 places, 35/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 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 12 rules applied. Total rules applied 13 place count 52 transition count 35
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 40 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 25 place count 40 transition count 34
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 39 transition count 34
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 43 place count 31 transition count 26
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 30 transition count 25
Applied a total of 44 rules in 5 ms. Remains 30 /57 variables (removed 27) and now considering 25/48 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 30/57 places, 25/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 48
Applied a total of 3 rules in 1 ms. Remains 54 /57 variables (removed 3) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 1 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 53/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 48
Applied a total of 3 rules in 1 ms. Remains 54 /57 variables (removed 3) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 54/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Graph (complete) has 87 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 54 transition count 38
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 45 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 45 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 42 transition count 35
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 34 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 33 transition count 26
Applied a total of 42 rules in 7 ms. Remains 33 /57 variables (removed 24) and now considering 26/48 (removed 22) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 33/57 places, 26/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 53 transition count 48
Applied a total of 4 rules in 2 ms. Remains 53 /57 variables (removed 4) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 53/57 places, 48/48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:53:12] [INFO ] Input system was already deterministic with 48 transitions.
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:53:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:53:12] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 10:53:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 57 places, 48 transitions and 135 arcs took 1 ms.
Total runtime 5891 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-001

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/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: 581
MODEL NAME: /home/mcc/execution/413/model
57 places, 48 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Convergence in 53 steps.
Building monolithic NSF...
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375192925

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="DoubleExponent-PT-001"
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 DoubleExponent-PT-001, 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-171631131300521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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