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.r311-tall-171662335900094.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 QuasiCertifProtocol-PT-22, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335900094
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K 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 QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716660111214

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:01:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 18:01:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:01:52] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-25 18:01:52] [INFO ] Transformed 1966 places.
[2024-05-25 18:01:52] [INFO ] Transformed 356 transitions.
[2024-05-25 18:01:52] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1485 resets) in 2844 ms. (14 steps per ms) remains 15/16 properties
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (8 resets) in 484 ms. (8 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 42 ms. (93 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 434 ms. (9 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 348118 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :0 out of 15
Probabilistic random walk after 348118 steps, saw 51721 distinct states, run finished after 3005 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 356 rows 1966 cols
[2024-05-25 18:01:57] [INFO ] Computed 1611 invariants in 90 ms
Problem QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1966 variables, 1608/1611 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1966 variables, 1608/1611 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5023 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 11395ms problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1966 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 43 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1966/1966 places, 356/356 transitions.
RANDOM walk for 40000 steps (1480 resets) in 2136 ms. (18 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (84 resets) in 2956 ms. (13 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (91 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 405 ms. (98 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (87 resets) in 415 ms. (96 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 312 ms. (127 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (86 resets) in 1449 ms. (27 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (50 resets) in 165 ms. (240 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (86 resets) in 141 ms. (281 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (88 resets) in 170 ms. (233 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (91 resets) in 134 ms. (296 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (85 resets) in 171 ms. (232 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 167 ms. (238 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 680683 steps, run timeout after 6001 ms. (steps per millisecond=113 ) properties seen :0 out of 14
Probabilistic random walk after 680683 steps, saw 95728 distinct states, run finished after 6001 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-25 18:02:17] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1966 variables, 1608/1611 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1966 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1966 variables, 1608/1611 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-25 18:03:25] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 54 ms to minimize.
[2024-05-25 18:03:26] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 11 ms to minimize.
[2024-05-25 18:03:26] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 5 ms to minimize.
[2024-05-25 18:03:26] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 5 ms to minimize.
[2024-05-25 18:03:27] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 4 ms to minimize.
[2024-05-25 18:03:27] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 4 ms to minimize.
[2024-05-25 18:03:27] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 5 ms to minimize.
[2024-05-25 18:03:27] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 4 ms to minimize.
[2024-05-25 18:03:28] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 4 ms to minimize.
[2024-05-25 18:03:28] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 4 ms to minimize.
[2024-05-25 18:03:28] [INFO ] Deduced a trap composed of 9 places in 377 ms of which 7 ms to minimize.
[2024-05-25 18:03:29] [INFO ] Deduced a trap composed of 9 places in 379 ms of which 6 ms to minimize.
[2024-05-25 18:03:29] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 6 ms to minimize.
[2024-05-25 18:03:30] [INFO ] Deduced a trap composed of 11 places in 349 ms of which 6 ms to minimize.
[2024-05-25 18:03:30] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 6 ms to minimize.
[2024-05-25 18:03:30] [INFO ] Deduced a trap composed of 12 places in 355 ms of which 6 ms to minimize.
[2024-05-25 18:03:31] [INFO ] Deduced a trap composed of 8 places in 371 ms of which 6 ms to minimize.
[2024-05-25 18:03:31] [INFO ] Deduced a trap composed of 9 places in 367 ms of which 6 ms to minimize.
[2024-05-25 18:03:32] [INFO ] Deduced a trap composed of 12 places in 361 ms of which 6 ms to minimize.
[2024-05-25 18:03:32] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1966/2322 variables, and 1631 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45018 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/14 constraints, Known Traps: 20/20 constraints]
After SMT, in 90784ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1966 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 21 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 1966/1966 places, 356/356 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 16 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
[2024-05-25 18:03:47] [INFO ] Invariant cache hit.
[2024-05-25 18:03:48] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-25 18:03:48] [INFO ] Invariant cache hit.
[2024-05-25 18:03:49] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2024-05-25 18:03:49] [INFO ] Redundant transitions in 21 ms returned []
Running 332 sub problems to find dead transitions.
[2024-05-25 18:03:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-25 18:04:11] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 2 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 5 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-25 18:04:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 20/1101 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1943/2322 variables, and 1101 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1078/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 20/1101 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-25 18:04:31] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-25 18:04:31] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1943 variables, 2/1103 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/2322 variables, and 1103 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1078/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/332 constraints, Known Traps: 22/22 constraints]
After SMT, in 60431ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60437ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62244 ms. Remains : 1966/1966 places, 356/356 transitions.
[2024-05-25 18:04:50] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 16 ms.
[2024-05-25 18:04:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1966 places, 356 transitions and 4323 arcs took 9 ms.
[2024-05-25 18:04:50] [INFO ] Flatten gal took : 168 ms
Total runtime 178212 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-PT-22

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: 1966
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.023s, Sys 0.002s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 704
MODEL NAME: /home/mcc/execution/411/model
1966 places, 356 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
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="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="ReachabilityCardinality"
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 QuasiCertifProtocol-PT-22, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335900094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-22.tgz
mv QuasiCertifProtocol-PT-22 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;