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-171690530300433.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 Sudoku-COL-AN04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530300433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.2K Apr 12 11:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 11:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 11:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 11:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 11:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 11:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 11:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 11:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN04-CTLCardinality-2024-00
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-01
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-02
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-03
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-04
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-05
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-06
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-07
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-08
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-09
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-10
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-11
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-12
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-13
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-14
FORMULA_NAME Sudoku-COL-AN04-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717025174143

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 23:26:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 23:26:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 23:26:15] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-29 23:26:15] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-29 23:26:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 506 ms
[2024-05-29 23:26:15] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 112 PT places and 64.0 transition bindings in 11 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 31 ms.
[2024-05-29 23:26:15] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-29 23:26:15] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 3 formulas.
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 59 to 58
RANDOM walk for 40028 steps (2220 resets) in 1010 ms. (39 steps per ms) remains 45/58 properties
BEST_FIRST walk for 4028 steps (220 resets) in 48 ms. (82 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 46 ms. (85 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 87 ms. (45 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 92 ms. (43 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 101 ms. (39 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 68 ms. (58 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 71 ms. (55 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 24 ms. (161 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 46 ms. (85 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 29 ms. (134 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 14 ms. (268 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 24 ms. (161 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 9 ms. (402 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 16 ms. (236 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 15 ms. (251 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 12 ms. (309 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 17 ms. (223 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 9 ms. (402 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 18 ms. (212 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 10 ms. (366 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 21 ms. (183 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 18 ms. (212 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 13 ms. (287 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 11 ms. (335 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 20 ms. (191 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4028 steps (220 resets) in 9 ms. (402 steps per ms) remains 45/45 properties
// Phase 1: matrix 1 rows 4 cols
[2024-05-29 23:26:16] [INFO ] Computed 3 invariants in 4 ms
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 45 solved, 0 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/4 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 275ms problems are : Problem set: 45 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 45 atomic propositions for a total of 15 simplifications.
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:26:17] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-29 23:26:17] [INFO ] Flatten gal took : 13 ms
[2024-05-29 23:26:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 23:26:17] [INFO ] Flatten gal took : 1 ms
Domain [N(4), N(4)] of place Rows breaks symmetries in sort N
[2024-05-29 23:26:17] [INFO ] Unfolded HLPN to a Petri net with 112 places and 64 transitions 256 arcs in 10 ms.
[2024-05-29 23:26:17] [INFO ] Unfolded 3 HLPN properties in 0 ms.
Support contains 112 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 112 cols
[2024-05-29 23:26:17] [INFO ] Computed 48 invariants in 10 ms
[2024-05-29 23:26:17] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 23:26:17] [INFO ] Invariant cache hit.
[2024-05-29 23:26:17] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 1ms
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 112/112 places, 64/64 transitions.
Support contains 112 out of 112 places after structural reductions.
[2024-05-29 23:26:17] [INFO ] Flatten gal took : 14 ms
[2024-05-29 23:26:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 23:26:17] [INFO ] Input system was already deterministic with 64 transitions.
RANDOM walk for 40000 steps (2777 resets) in 1510 ms. (26 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (120 resets) in 143 ms. (277 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 114 ms. (347 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 137 ms. (289 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 120 ms. (330 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (120 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
[2024-05-29 23:26:18] [INFO ] Invariant cache hit.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
After SMT solving in domain Real declared 112/176 variables, and 48 constraints, problems are : Problem set: 8 solved, 0 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 0/112 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 3 simplifications.
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 8 ms
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 23:26:18] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 112 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 112 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 10 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 48/112 places, 64/64 transitions.
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:26:18] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 48 transition count 64
Applied a total of 64 rules in 4 ms. Remains 48 /112 variables (removed 64) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 48/112 places, 64/64 transitions.
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 4 ms
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:26:18] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 112/112 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 112 /112 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 112/112 places, 64/64 transitions.
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 23:26:18] [INFO ] Input system was already deterministic with 64 transitions.
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 23:26:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 23:26:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-29 23:26:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 64 transitions and 256 arcs took 3 ms.
Total runtime 3288 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-COL-AN04

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 532
MODEL NAME: /home/mcc/execution/411/model
112 places, 64 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.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA Sudoku-COL-AN04-CTLCardinality-2024-07 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717025671234

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="Sudoku-COL-AN04"
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 Sudoku-COL-AN04, 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-171690530300433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN04.tgz
mv Sudoku-COL-AN04 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 ;