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.r069-tall-171620504700534.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 ClientsAndServers-PT-N5000P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504700534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 23:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 23:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 23:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 12 23:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 9.2K May 18 16:42 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716463215005

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N5000P0
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 11:20:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 11:20:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:20:16] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2024-05-23 11:20:16] [INFO ] Transformed 25 places.
[2024-05-23 11:20:16] [INFO ] Transformed 18 transitions.
[2024-05-23 11:20:16] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 160004 steps (0 resets) in 440 ms. (362 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 267 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 182 ms. (21 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 112 ms. (35 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 169610 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :1 out of 16
Probabilistic random walk after 169610 steps, saw 120313 distinct states, run finished after 3016 ms. (steps per millisecond=56 ) properties seen :1
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 18 rows 25 cols
[2024-05-23 11:20:20] [INFO ] Computed 8 invariants in 9 ms
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-02 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-07 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-08 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 4 solved, 11 unsolved
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-09 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-11 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-12 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-15 is UNSAT
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 8 solved, 7 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 5/5 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 7/40 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/43 variables, 0/40 constraints. Problems are: Problem set: 8 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 40 constraints, problems are : Problem set: 8 solved, 7 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 7/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 816ms problems are : Problem set: 8 solved, 7 unsolved
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 30003 ms.
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 12 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 25/25 places, 18/18 transitions.
RANDOM walk for 160004 steps (0 resets) in 39 ms. (4000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 416335 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :0 out of 3
Probabilistic random walk after 416335 steps, saw 296571 distinct states, run finished after 3002 ms. (steps per millisecond=138 ) properties seen :0
[2024-05-23 11:20:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 3 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 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/24 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 36 constraints, problems are : Problem set: 0 solved, 3 unsolved in 124 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 30004 ms.
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 21 transition count 16
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 15
Applied a total of 8 rules in 31 ms. Remains 20 /25 variables (removed 5) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 20/25 places, 15/18 transitions.
RANDOM walk for 160004 steps (0 resets) in 294 ms. (542 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 495212 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 2
Probabilistic random walk after 495212 steps, saw 356896 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 15 rows 20 cols
[2024-05-23 11:21:27] [INFO ] Computed 6 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/35 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 26 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/19 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1/20 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/35 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-23 11:21:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 29 constraints, problems are : Problem set: 0 solved, 2 unsolved in 125 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 208ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 132928 steps, including 0 resets, run visited all 2 properties in 435 ms. (steps per millisecond=305 )
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 443 ms.
All properties solved without resorting to model-checking.
Total runtime 72018 ms.
ITS solved all properties within timeout

BK_STOP 1716463288280

--------------------
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="ClientsAndServers-PT-N5000P0"
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 ClientsAndServers-PT-N5000P0, 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 r069-tall-171620504700534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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