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.r575-smll-171734919400022.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 MedleyA-PT-03, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919400022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 5.9K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 26K Jun 2 16:33 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 MedleyA-PT-03-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-03-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717352048922

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:14:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:14:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:11] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2024-06-02 18:14:11] [INFO ] Transformed 108 places.
[2024-06-02 18:14:11] [INFO ] Transformed 100 transitions.
[2024-06-02 18:14:11] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:11] [INFO ] Parsed PT model containing 108 places and 100 transitions and 272 arcs in 464 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 70 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (654 resets) in 2243 ms. (17 steps per ms) remains 3/15 properties
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (173 resets) in 594 ms. (67 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (171 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (172 resets) in 414 ms. (96 steps per ms) remains 3/3 properties
// Phase 1: matrix 100 rows 108 cols
[2024-06-02 18:14:13] [INFO ] Computed 9 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 56/108 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 56/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 100/208 variables, 108/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/208 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 225 constraints, problems are : Problem set: 0 solved, 3 unsolved in 764 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MedleyA-PT-03-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 56/108 variables, 9/61 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 56/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 100/208 variables, 108/225 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/208 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 18:14:14] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 13 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/208 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 228 constraints, problems are : Problem set: 1 solved, 2 unsolved in 799 ms.
Refiners :[Domain max(s): 108/108 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1729ms problems are : Problem set: 1 solved, 2 unsolved
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 769 ms.
Support contains 31 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 100/100 transitions.
Graph (complete) has 186 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 107 transition count 91
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 12 rules applied. Total rules applied 22 place count 98 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 25 place count 95 transition count 88
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 25 place count 95 transition count 84
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 33 place count 91 transition count 84
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 38 place count 86 transition count 79
Iterating global reduction 3 with 5 rules applied. Total rules applied 43 place count 86 transition count 79
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 63 place count 76 transition count 69
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 76 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 75 transition count 68
Applied a total of 65 rules in 104 ms. Remains 75 /108 variables (removed 33) and now considering 68/100 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 75/108 places, 68/100 transitions.
RANDOM walk for 40000 steps (1109 resets) in 435 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (363 resets) in 225 ms. (177 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 3091316 steps, run timeout after 3001 ms. (steps per millisecond=1030 ) properties seen :0 out of 1
Probabilistic random walk after 3091316 steps, saw 582540 distinct states, run finished after 3006 ms. (steps per millisecond=1028 ) properties seen :0
// Phase 1: matrix 68 rows 75 cols
[2024-06-02 18:14:19] [INFO ] Computed 8 invariants in 9 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/129 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/143 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/143 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 117 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 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/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 30/61 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 68/129 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/143 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 254 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 31 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 75/75 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-06-02 18:14:19] [INFO ] Invariant cache hit.
[2024-06-02 18:14:19] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 18:14:19] [INFO ] Invariant cache hit.
[2024-06-02 18:14:19] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-06-02 18:14:19] [INFO ] Redundant transitions in 2 ms returned []
Running 67 sub problems to find dead transitions.
[2024-06-02 18:14:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:14:20] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 68/143 variables, 75/97 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 99 constraints, problems are : Problem set: 0 solved, 67 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 68/143 variables, 75/99 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/143 variables, 67/166 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-06-02 18:14:25] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/143 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 0/143 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 167 constraints, problems are : Problem set: 0 solved, 67 unsolved in 5244 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 75/75 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 17/17 constraints]
After SMT, in 9338ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 9341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9625 ms. Remains : 75/75 places, 68/68 transitions.
[2024-06-02 18:14:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 12 ms.
[2024-06-02 18:14:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 75 places, 68 transitions and 209 arcs took 13 ms.
[2024-06-02 18:14:29] [INFO ] Flatten gal took : 58 ms
Total runtime 18123 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-03

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/418/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: 623
MODEL NAME: /home/mcc/execution/418/model
75 places, 68 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA MedleyA-PT-03-ReachabilityCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717352077515

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

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="MedleyA-PT-03"
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 MedleyA-PT-03, 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 r575-smll-171734919400022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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