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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.9M
-rw-r--r-- 1 mcc users 74K Apr 13 04:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 496K Apr 13 04:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 13 04:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 13 04:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 339K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 141K Apr 13 04:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 906K Apr 13 04:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Apr 13 04:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 503K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716660115190

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 18:01:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-25 18:01:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 18:01:56] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-05-25 18:01:56] [INFO ] Transformed 1966 places.
[2024-05-25 18:01:56] [INFO ] Transformed 356 transitions.
[2024-05-25 18:01:56] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1483 resets) in 2191 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 482 ms. (8 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 95 ms. (41 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1040 ms. (3 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 202 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 188 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 454660 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 15
Probabilistic random walk after 454660 steps, saw 64198 distinct states, run finished after 3015 ms. (steps per millisecond=150 ) properties seen :0
// Phase 1: matrix 356 rows 1966 cols
[2024-05-25 18:02:01] [INFO ] Computed 1611 invariants in 102 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-02 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1943 variables, 0/1081 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 23/1966 variables, 530/1611 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5055 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 28/1943 variables, 3/1081 constraints. Problems are: Problem set: 2 solved, 13 unsolved
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 19 ms to minimize.
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 8 places in 103 ms of which 5 ms to minimize.
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 3 ms to minimize.
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 11 places in 95 ms of which 1 ms to minimize.
[2024-05-25 18:02:10] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-25 18:02:11] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-25 18:02:11] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-25 18:02:11] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 2 ms to minimize.
[2024-05-25 18:02:11] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-25 18:02:11] [INFO ] Deduced a trap composed of 8 places in 132 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1943/2322 variables, and 1092 constraints, problems are : Problem set: 2 solved, 13 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1078/1608 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 0/15 constraints, Known Traps: 11/11 constraints]
After SMT, in 11515ms problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1915 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1916 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.9 ms
Discarding 50 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 84 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 1916/1966 places, 356/356 transitions.
RANDOM walk for 40000 steps (1487 resets) in 838 ms. (47 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (86 resets) in 155 ms. (256 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (91 resets) in 114 ms. (347 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (87 resets) in 831 ms. (48 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (63 resets) in 918 ms. (43 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (88 resets) in 1643 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (69 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (45 resets) in 170 ms. (233 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (72 resets) in 56 ms. (701 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (70 resets) in 149 ms. (266 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (86 resets) in 61 ms. (645 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (95 resets) in 64 ms. (615 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (92 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (88 resets) in 167 ms. (238 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 510216 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :0 out of 13
Probabilistic random walk after 510216 steps, saw 72067 distinct states, run finished after 3001 ms. (steps per millisecond=170 ) properties seen :0
// Phase 1: matrix 356 rows 1916 cols
[2024-05-25 18:02:17] [INFO ] Computed 1562 invariants in 45 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-08 is UNSAT
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 0/3477 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 1/2272 variables, 1/3478 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 0/2272 variables, 0/3478 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2272/2272 variables, and 3478 constraints, problems are : Problem set: 1 solved, 12 unsolved in 13280 ms.
Refiners :[Generalized P Invariants (flows): 1562/1562 constraints, State Equation: 1916/1916 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1562/1562 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1562 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 356/2271 variables, 1915/3477 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2271 variables, 12/3489 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2271 variables, 0/3489 constraints. Problems are: Problem set: 1 solved, 12 unsolved
SMT process timed out in 59030ms, After SMT, problems are : Problem set: 1 solved, 12 unsolved
Fused 12 Parikh solutions to 5 different solutions.
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-00 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-11 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-06 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 11 properties in 1026 ms.
Support contains 67 out of 1916 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1916/1916 places, 356/356 transitions.
Graph (complete) has 15277 edges and 1916 vertex of which 1387 are kept as prefixes of interest. Removing 529 places using SCC suffix rule.7 ms
Discarding 529 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 1387 transition count 307
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 50 place count 1387 transition count 305
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 1385 transition count 305
Discarding 44 places :
Symmetric choice reduction at 1 with 44 rule applications. Total rules 98 place count 1341 transition count 261
Iterating global reduction 1 with 44 rules applied. Total rules applied 142 place count 1341 transition count 261
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 1 with 21 rules applied. Total rules applied 163 place count 1341 transition count 261
Applied a total of 163 rules in 883 ms. Remains 1341 /1916 variables (removed 575) and now considering 261/356 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 1341/1916 places, 261/356 transitions.
RANDOM walk for 40000 steps (1537 resets) in 421 ms. (94 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (93 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1609434 steps, run timeout after 3001 ms. (steps per millisecond=536 ) properties seen :0 out of 1
Probabilistic random walk after 1609434 steps, saw 230887 distinct states, run finished after 3001 ms. (steps per millisecond=536 ) properties seen :0
// Phase 1: matrix 261 rows 1341 cols
[2024-05-25 18:03:21] [INFO ] Computed 1080 invariants in 19 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/128 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1035/1163 variables, 958/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1163 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/1236 variables, 73/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1236 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 261/1497 variables, 1236/2316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1497 variables, 0/2316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 105/1602 variables, 105/2421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 0/2421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1602 variables, 0/2421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1602/1602 variables, and 2421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 707 ms.
Refiners :[Generalized P Invariants (flows): 1080/1080 constraints, State Equation: 1341/1341 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/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 61/128 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1035/1163 variables, 958/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1163 variables, 0/1007 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 73/1236 variables, 73/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1236 variables, 0/1080 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 261/1497 variables, 1236/2316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1497 variables, 0/2316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 105/1602 variables, 105/2421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1602 variables, 1/2422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1602 variables, 0/2422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1602 variables, 0/2422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1602/1602 variables, and 2422 constraints, problems are : Problem set: 0 solved, 1 unsolved in 872 ms.
Refiners :[Generalized P Invariants (flows): 1080/1080 constraints, State Equation: 1341/1341 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1630ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 120 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
FORMULA QuasiCertifProtocol-PT-22-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 9 ms.
All properties solved without resorting to model-checking.
Total runtime 86753 ms.
ITS solved all properties within timeout

BK_STOP 1716660203174

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is QuasiCertifProtocol-PT-22, examination is ReachabilityFireability"
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-171662335900095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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