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

About the Execution of GreatSPN+red for Sudoku-PT-AN14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13465.092 1689721.00 4909128.00 2392.10 T??T?????T?TF??F 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-171690530900673.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-PT-AN14, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690530900673
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 70M
-rw-r--r-- 1 mcc users 1.2M Apr 12 12:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.1M Apr 12 12:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1M Apr 12 10:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 12 10:17 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 702K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 2.2M Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5M Apr 12 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 7.0M Apr 12 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6M Apr 12 12:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22M Apr 12 12:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 98K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 237K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.5M 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-PT-AN14-CTLCardinality-2024-00
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-01
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-02
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-03
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-04
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-05
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-06
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-07
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-08
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-09
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-10
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-11
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-12
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-13
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-14
FORMULA_NAME Sudoku-PT-AN14-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717077037428

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 13:50:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 13:50:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:50:38] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-05-30 13:50:38] [INFO ] Transformed 3332 places.
[2024-05-30 13:50:38] [INFO ] Transformed 2744 transitions.
[2024-05-30 13:50:38] [INFO ] Found NUPN structural information;
[2024-05-30 13:50:38] [INFO ] Parsed PT model containing 3332 places and 2744 transitions and 10976 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 160 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Sudoku-PT-AN14-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
// Phase 1: matrix 2744 rows 3332 cols
[2024-05-30 13:50:39] [INFO ] Computed 588 invariants in 49 ms
[2024-05-30 13:50:40] [INFO ] Implicit Places using invariants in 1202 ms returned []
[2024-05-30 13:50:40] [INFO ] Invariant cache hit.
[2024-05-30 13:50:46] [INFO ] Implicit Places using invariants and state equation in 6220 ms returned []
Implicit Place search using SMT with State Equation took 7453 ms to find 0 implicit places.
Running 0 sub problems to find dead transitions.
Search for dead transitions found 0 dead transitions in 4ms
Finished structural reductions in LTL mode , in 1 iterations and 7512 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Support contains 3332 out of 3332 places after structural reductions.
[2024-05-30 13:50:47] [INFO ] Flatten gal took : 342 ms
[2024-05-30 13:50:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA Sudoku-PT-AN14-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 13:50:48] [INFO ] Flatten gal took : 198 ms
[2024-05-30 13:50:48] [INFO ] Input system was already deterministic with 2744 transitions.
RANDOM walk for 40000 steps (229 resets) in 13654 ms. (2 steps per ms) remains 9/63 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1436 ms. (27 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3181 ms. (12 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1299 ms. (30 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1060 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 596 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 563 ms. (70 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2814 ms. (14 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1023 ms. (39 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 541 ms. (73 steps per ms) remains 8/9 properties
[2024-05-30 13:50:56] [INFO ] Invariant cache hit.
Problem AtomicPropp10 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 3332/3332 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 588/3920 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 3920 constraints, problems are : Problem set: 4 solved, 4 unsolved in 5006 ms.
Refiners :[Domain max(s): 3332/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 3332/3332 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3332/6076 variables, and 3920 constraints, problems are : Problem set: 4 solved, 4 unsolved in 4650 ms.
Refiners :[Domain max(s): 3332/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 10938ms problems are : Problem set: 4 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 46 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 3332/3332 places, 2744/2744 transitions.
RANDOM walk for 40000 steps (231 resets) in 8733 ms. (4 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1109 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 557 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 591 ms. (67 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2777 ms. (14 steps per ms) remains 4/4 properties
Probabilistic random walk after 156960 steps, saw 156886 distinct states, run finished after 9024 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-30 13:51:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 3332/3332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3332/6076 variables, and 3920 constraints, problems are : Problem set: 0 solved, 4 unsolved in 37178 ms.
Refiners :[Domain max(s): 3332/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 0/3332 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3332 variables, 3332/3332 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/3332 variables, 588/3920 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3332 variables, 0/3920 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 6076/6076 variables, and 7252 constraints, problems are : Problem set: 1 solved, 3 unsolved in 45032 ms.
Refiners :[Domain max(s): 3332/3332 constraints, Positive P Invariants (semi-flows): 588/588 constraints, State Equation: 3332/3332 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 82587ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3332 out of 3332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 45 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 3332/3332 places, 2744/2744 transitions.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2024-05-30 13:52:42] [INFO ] Flatten gal took : 156 ms
[2024-05-30 13:52:43] [INFO ] Flatten gal took : 176 ms
[2024-05-30 13:52:43] [INFO ] Input system was already deterministic with 2744 transitions.
Computed a total of 3332 stabilizing places and 2744 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3332 transition count 2744
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-PT-AN14-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN14-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 11 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:44] [INFO ] Flatten gal took : 116 ms
[2024-05-30 13:52:44] [INFO ] Flatten gal took : 127 ms
[2024-05-30 13:52:44] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 107 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:44] [INFO ] Flatten gal took : 103 ms
[2024-05-30 13:52:44] [INFO ] Flatten gal took : 119 ms
[2024-05-30 13:52:45] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Graph (complete) has 8232 edges and 3332 vertex of which 588 are kept as prefixes of interest. Removing 2744 places using SCC suffix rule.11 ms
Discarding 2744 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 132 ms. Remains 588 /3332 variables (removed 2744) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 133 ms. Remains : 588/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:45] [INFO ] Flatten gal took : 76 ms
[2024-05-30 13:52:45] [INFO ] Flatten gal took : 78 ms
[2024-05-30 13:52:45] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 31 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:45] [INFO ] Flatten gal took : 101 ms
[2024-05-30 13:52:45] [INFO ] Flatten gal took : 115 ms
[2024-05-30 13:52:46] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 39 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:46] [INFO ] Flatten gal took : 108 ms
[2024-05-30 13:52:46] [INFO ] Flatten gal took : 112 ms
[2024-05-30 13:52:46] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Applied a total of 0 rules in 8 ms. Remains 3332 /3332 variables (removed 0) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 3332/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:46] [INFO ] Flatten gal took : 104 ms
[2024-05-30 13:52:46] [INFO ] Flatten gal took : 111 ms
[2024-05-30 13:52:47] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2730 places and 0 transitions.
Iterating post reduction 0 with 2730 rules applied. Total rules applied 2730 place count 602 transition count 2744
Applied a total of 2730 rules in 149 ms. Remains 602 /3332 variables (removed 2730) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 602/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:47] [INFO ] Flatten gal took : 70 ms
[2024-05-30 13:52:47] [INFO ] Flatten gal took : 81 ms
[2024-05-30 13:52:47] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2742 places and 0 transitions.
Iterating post reduction 0 with 2742 rules applied. Total rules applied 2742 place count 590 transition count 2744
Applied a total of 2742 rules in 65 ms. Remains 590 /3332 variables (removed 2742) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 590/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:47] [INFO ] Flatten gal took : 72 ms
[2024-05-30 13:52:47] [INFO ] Flatten gal took : 83 ms
[2024-05-30 13:52:47] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2738 places and 0 transitions.
Iterating post reduction 0 with 2738 rules applied. Total rules applied 2738 place count 594 transition count 2744
Applied a total of 2738 rules in 63 ms. Remains 594 /3332 variables (removed 2738) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 594/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:48] [INFO ] Flatten gal took : 76 ms
[2024-05-30 13:52:48] [INFO ] Flatten gal took : 87 ms
[2024-05-30 13:52:48] [INFO ] Input system was already deterministic with 2744 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3332/3332 places, 2744/2744 transitions.
Reduce places removed 2737 places and 0 transitions.
Iterating post reduction 0 with 2737 rules applied. Total rules applied 2737 place count 595 transition count 2744
Applied a total of 2737 rules in 61 ms. Remains 595 /3332 variables (removed 2737) and now considering 2744/2744 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 595/3332 places, 2744/2744 transitions.
[2024-05-30 13:52:48] [INFO ] Flatten gal took : 74 ms
[2024-05-30 13:52:48] [INFO ] Flatten gal took : 77 ms
[2024-05-30 13:52:48] [INFO ] Input system was already deterministic with 2744 transitions.
[2024-05-30 13:52:48] [INFO ] Flatten gal took : 120 ms
[2024-05-30 13:52:49] [INFO ] Flatten gal took : 122 ms
[2024-05-30 13:52:49] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 19 ms.
[2024-05-30 13:52:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3332 places, 2744 transitions and 10976 arcs took 16 ms.
Total runtime 131012 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Sudoku-PT-AN14

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: 3332
TRANSITIONS: 2744
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.055s, Sys 0.014s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.011s, 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: 579
MODEL NAME: /home/mcc/execution/413/model
3332 places, 2744 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1717078727149

--------------------
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

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-PT-AN14"
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-PT-AN14, 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-171690530900673"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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