Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662335800086.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335800086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 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 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716656869187

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 17:07:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 17:07:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 17:07:50] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-25 17:07:50] [INFO ] Transformed 1398 places.
[2024-05-25 17:07:50] [INFO ] Transformed 296 transitions.
[2024-05-25 17:07:50] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1762 resets) in 2015 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 64 ms. (61 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (13 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (14 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 317 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 87 ms. (45 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 545380 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 16
Probabilistic random walk after 545380 steps, saw 79715 distinct states, run finished after 3006 ms. (steps per millisecond=181 ) properties seen :0
// Phase 1: matrix 296 rows 1398 cols
[2024-05-25 17:07:54] [INFO ] Computed 1103 invariants in 60 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 105/339 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/339 variables, 35/40 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/341 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 538/879 variables, 543/584 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/879 variables, 0/584 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 519/1398 variables, 519/1103 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1398 variables, 0/1103 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 296/1694 variables, 1398/2501 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1694 variables, 0/2501 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1694/1694 variables, and 2501 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5054 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 132/224 variables, 2/3 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 3/6 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 17:07:59] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 17 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 2/8 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 0/8 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 2/226 variables, 1/9 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/9 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 465/691 variables, 431/440 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 2 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 2 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 2 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 5 ms to minimize.
[2024-05-25 17:08:00] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/691 variables, 15/455 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 17:08:01] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/691 variables, 1/456 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/691 variables, 0/456 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 707/1398 variables, 665/1121 constraints. Problems are: Problem set: 11 solved, 5 unsolved
[2024-05-25 17:08:02] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 2 ms to minimize.
[2024-05-25 17:08:02] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 2 ms to minimize.
[2024-05-25 17:08:02] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 2 ms to minimize.
[2024-05-25 17:08:02] [INFO ] Deduced a trap composed of 6 places in 100 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-25 17:08:03] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-25 17:08:04] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-25 17:08:04] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1398 variables, 17/1138 constraints. Problems are: Problem set: 11 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1398 variables, 0/1138 constraints. Problems are: Problem set: 11 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1694/1694 variables, and 2536 constraints, problems are : Problem set: 11 solved, 5 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 1398/1398 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 35/35 constraints]
After SMT, in 10224ms problems are : Problem set: 11 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 92 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 1262 are kept as prefixes of interest. Removing 136 places using SCC suffix rule.6 ms
Discarding 136 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Discarding 34 places :
Implicit places reduction removed 34 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 167 rules applied. Total rules applied 168 place count 1228 transition count 158
Reduce places removed 4 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 9 rules applied. Total rules applied 177 place count 1224 transition count 153
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 182 place count 1219 transition count 153
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 182 place count 1219 transition count 136
Deduced a syphon composed of 17 places in 1 ms
Ensure Unique test removed 27 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 243 place count 1175 transition count 136
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 108 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 395 place count 1045 transition count 114
Applied a total of 395 rules in 272 ms. Remains 1045 /1398 variables (removed 353) and now considering 114/296 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 1045/1398 places, 114/296 transitions.
RANDOM walk for 40000 steps (2965 resets) in 565 ms. (70 steps per ms) remains 3/5 properties
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (501 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (494 resets) in 141 ms. (281 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (463 resets) in 235 ms. (169 steps per ms) remains 3/3 properties
// Phase 1: matrix 114 rows 1045 cols
[2024-05-25 17:08:05] [INFO ] Computed 931 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 641/721 variables, 617/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 323/1044 variables, 310/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 113/1157 variables, 1044/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 0/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/1159 variables, 1/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1159 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/1159 variables, 0/1976 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 1976 constraints, problems are : Problem set: 0 solved, 3 unsolved in 986 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 928/928 constraints, State Equation: 1045/1045 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/73 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/73 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 7/80 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 641/721 variables, 617/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/721 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 323/1044 variables, 310/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1044 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 113/1157 variables, 1044/1975 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1157 variables, 2/1977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1157 variables, 0/1977 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 2/1159 variables, 1/1978 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1159 variables, 1/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1159 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1159 variables, 0/1979 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 1979 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1913 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 928/928 constraints, State Equation: 1045/1045 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2932ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 95 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=15 )
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 18001 ms.
ITS solved all properties within timeout

BK_STOP 1716656888383

--------------------
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="QuasiCertifProtocol-PT-18"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-18, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-171662335800086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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