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-171690529400006.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 Solitaire-PT-EngCT7x7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529400006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 77K 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 Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-00
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-01
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-02
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-03
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-04
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-05
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-06
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-07
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-08
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-09
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-10
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-11
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-12
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-13
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-14
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716965063291

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Solitaire-PT-EngCT7x7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 06:44:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 06:44:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 06:44:24] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-29 06:44:24] [INFO ] Transformed 67 places.
[2024-05-29 06:44:24] [INFO ] Transformed 76 transitions.
[2024-05-29 06:44:24] [INFO ] Parsed PT model containing 67 places and 76 transitions and 532 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1582 resets) in 3005 ms. (13 steps per ms) remains 15/16 properties
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4003 steps (20 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (20 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 105 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (22 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (21 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (19 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (20 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (22 resets) in 62 ms. (63 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 85 ms. (46 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 475416 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 15
Probabilistic random walk after 475416 steps, saw 101819 distinct states, run finished after 3031 ms. (steps per millisecond=156 ) properties seen :0
// Phase 1: matrix 76 rows 67 cols
[2024-05-29 06:44:29] [INFO ] Computed 34 invariants in 7 ms
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-00 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-01 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-02 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-03 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-04 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-05 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-06 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-07 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-08 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-09 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-11 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-12 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-13 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-14 is UNSAT
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 33/33 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 1/34 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/143 variables, 67/101 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/143 variables, 0/101 constraints. Problems are: Problem set: 14 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 101 constraints, problems are : Problem set: 14 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 16/17 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/51 variables, 1/18 constraints. Problems are: Problem set: 14 solved, 1 unsolved
[2024-05-29 06:44:29] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/19 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/19 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 16/67 variables, 16/35 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/35 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 76/143 variables, 67/102 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/103 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/103 constraints. Problems are: Problem set: 14 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/103 constraints. Problems are: Problem set: 14 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 103 constraints, problems are : Problem set: 14 solved, 1 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 1/15 constraints, Known Traps: 1/1 constraints]
After SMT, in 620ms problems are : Problem set: 14 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 19 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 67/67 places, 76/76 transitions.
RANDOM walk for 40000 steps (1566 resets) in 379 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (221 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2063039 steps, run timeout after 3001 ms. (steps per millisecond=687 ) properties seen :0 out of 1
Probabilistic random walk after 2063039 steps, saw 408304 distinct states, run finished after 3001 ms. (steps per millisecond=687 ) properties seen :0
[2024-05-29 06:44:33] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/51 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/67 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/143 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 16/35 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 16/51 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/67 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 76/143 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/143 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 19 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 67/67 places, 76/76 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-29 06:44:33] [INFO ] Invariant cache hit.
[2024-05-29 06:44:33] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-29 06:44:33] [INFO ] Invariant cache hit.
[2024-05-29 06:44:33] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-05-29 06:44:33] [INFO ] Redundant transitions in 3 ms returned []
Running 72 sub problems to find dead transitions.
[2024-05-29 06:44:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 76/143 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 101 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (OVERLAPS) 1/67 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/67 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 76/143 variables, 67/101 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 72/173 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 173 constraints, problems are : Problem set: 0 solved, 72 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 67/67 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 5217ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 5219ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5405 ms. Remains : 67/67 places, 76/76 transitions.
[2024-05-29 06:44:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-05-29 06:44:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 67 places, 76 transitions and 532 arcs took 10 ms.
[2024-05-29 06:44:39] [INFO ] Flatten gal took : 39 ms
Total runtime 14573 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Solitaire-PT-EngCT7x7

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: 67
TRANSITIONS: 76
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.004s, Sys 0.000s]


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: 560
MODEL NAME: /home/mcc/execution/413/model
67 places, 76 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.

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:
++ 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 ReachabilityCardinality -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="Solitaire-PT-EngCT7x7"
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 Solitaire-PT-EngCT7x7, 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 r399-tall-171690529400006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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