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

About the Execution of GreatSPN+red for Szymanski-PT-a02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
405.792 13637.00 28121.00 65.70 FFFTTFFFTTFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r399-tall-171690531200809.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 Szymanski-PT-a02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690531200809
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K 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 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K May 18 16:43 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 Szymanski-PT-a02-CTLCardinality-2024-00
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-01
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-02
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-03
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-04
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-05
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-06
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-07
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-08
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-09
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-10
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2024-11
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2023-12
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2023-13
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2023-14
FORMULA_NAME Szymanski-PT-a02-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717092122140

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 18:02:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 18:02:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 18:02:03] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-30 18:02:03] [INFO ] Transformed 61 places.
[2024-05-30 18:02:03] [INFO ] Transformed 224 transitions.
[2024-05-30 18:02:03] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA Szymanski-PT-a02-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Applied a total of 0 rules in 10 ms. Remains 49 /49 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-30 18:02:03] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-30 18:02:03] [INFO ] Computed 3 invariants in 9 ms
[2024-05-30 18:02:03] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-30 18:02:03] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:03] [INFO ] Invariant cache hit.
[2024-05-30 18:02:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 18:02:03] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-05-30 18:02:03] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:03] [INFO ] Invariant cache hit.
[2024-05-30 18:02:03] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-05-30 18:02:04] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 8 ms to minimize.
[2024-05-30 18:02:04] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 2 ms to minimize.
[2024-05-30 18:02:05] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-30 18:02:05] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 0 ms to minimize.
[2024-05-30 18:02:05] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-30 18:02:05] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 67 constraints, problems are : Problem set: 0 solved, 214 unsolved in 4612 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 1/49 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 79/128 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 214/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 281 constraints, problems are : Problem set: 0 solved, 214 unsolved in 4267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 6/6 constraints]
After SMT, in 9027ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 9053ms
Finished structural reductions in LTL mode , in 1 iterations and 9380 ms. Remains : 49/49 places, 216/216 transitions.
Support contains 40 out of 49 places after structural reductions.
[2024-05-30 18:02:13] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-30 18:02:13] [INFO ] Flatten gal took : 38 ms
FORMULA Szymanski-PT-a02-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:02:13] [INFO ] Flatten gal took : 17 ms
[2024-05-30 18:02:13] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 35 out of 49 places (down from 40) after GAL structural reductions.
FORMULA Szymanski-PT-a02-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40002 steps (136 resets) in 1686 ms. (23 steps per ms) remains 9/28 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (8 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (13 resets) in 112 ms. (354 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 81 ms. (487 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (11 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (42 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
[2024-05-30 18:02:14] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 18:02:14] [INFO ] Invariant cache hit.
[2024-05-30 18:02:14] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/49 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem AtomicPropp10 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/3 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-30 18:02:14] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 1/4 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-30 18:02:14] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/49 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 9 solved, 0 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 49/49 constraints, ReadFeed: 0/9 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 2/2 constraints]
After SMT, in 169ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 8 simplifications.
[2024-05-30 18:02:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 18:02:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Szymanski-PT-a02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 12 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 26 out of 49 places (down from 29) after GAL structural reductions.
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 21 place count 43 transition count 188
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 42 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 42 transition count 184
Applied a total of 23 rules in 31 ms. Remains 42 /49 variables (removed 7) and now considering 184/216 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 42/49 places, 184/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 45 transition count 208
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 45 transition count 208
Applied a total of 6 rules in 4 ms. Remains 45 /49 variables (removed 4) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 45/49 places, 208/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 11 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 384 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 43 transition count 200
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 41 transition count 176
Applied a total of 29 rules in 20 ms. Remains 41 /49 variables (removed 8) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 41/49 places, 176/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 53 steps (0 resets) in 8 ms. (5 steps per ms) remains 0/1 properties
FORMULA Szymanski-PT-a02-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 48 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 44 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 44 transition count 200
Applied a total of 9 rules in 2 ms. Remains 44 /49 variables (removed 5) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/49 places, 200/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 46 transition count 212
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 46 transition count 212
Applied a total of 4 rules in 4 ms. Remains 46 /49 variables (removed 3) and now considering 212/216 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 46/49 places, 212/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 43 transition count 200
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 43 transition count 200
Applied a total of 10 rules in 8 ms. Remains 43 /49 variables (removed 6) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 43/49 places, 200/216 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 8 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Input system was already deterministic with 200 transitions.
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Flatten gal took : 9 ms
[2024-05-30 18:02:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-30 18:02:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 49 places, 216 transitions and 868 arcs took 3 ms.
Total runtime 11463 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Szymanski-PT-a02

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: 49
TRANSITIONS: 216
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.002s]


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: 569
MODEL NAME: /home/mcc/execution/413/model
49 places, 216 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Szymanski-PT-a02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Szymanski-PT-a02-CTLCardinality-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717092135777

--------------------
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="Szymanski-PT-a02"
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 Szymanski-PT-a02, 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 r399-tall-171690531200809"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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