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.r520-tall-171662337800087.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 ltsminxred
Input is QuasiCertifProtocol-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337800087
=====================================================================

--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717220289212

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:38:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:38:10] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2024-06-01 05:38:10] [INFO ] Transformed 1398 places.
[2024-06-01 05:38:10] [INFO ] Transformed 296 transitions.
[2024-06-01 05:38:10] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 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 (1764 resets) in 1587 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 501 ms. (7 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 198 ms. (20 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 945 ms. (4 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 151 ms. (26 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 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (13 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 516023 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 15
Probabilistic random walk after 516023 steps, saw 76302 distinct states, run finished after 3005 ms. (steps per millisecond=171 ) properties seen :0
// Phase 1: matrix 296 rows 1398 cols
[2024-06-01 05:38:14] [INFO ] Computed 1103 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1071 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1071 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 23/1094 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1094 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-13 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 135/1229 variables, 855/934 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1229 variables, 0/934 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 169/1398 variables, 169/1103 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1398/1694 variables, and 1103 constraints, problems are : Problem set: 1 solved, 14 unsolved in 5050 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1100/1100 constraints, State Equation: 0/1398 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1052 variables, 71/71 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1052 variables, 0/71 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 23/1075 variables, 3/74 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 05:38:21] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 14 ms to minimize.
[2024-06-01 05:38:21] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 3 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 8 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:38:22] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1075 variables, 8/82 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1075 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 141/1216 variables, 847/929 constraints. Problems are: Problem set: 1 solved, 14 unsolved
[2024-06-01 05:38:24] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 5 ms to minimize.
[2024-06-01 05:38:24] [INFO ] Deduced a trap composed of 6 places in 151 ms of which 3 ms to minimize.
[2024-06-01 05:38:24] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 3 ms to minimize.
[2024-06-01 05:38:24] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 2 ms to minimize.
[2024-06-01 05:38:25] [INFO ] Deduced a trap composed of 6 places in 146 ms of which 3 ms to minimize.
[2024-06-01 05:38:25] [INFO ] Deduced a trap composed of 6 places in 127 ms of which 3 ms to minimize.
[2024-06-01 05:38:25] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 3 ms to minimize.
[2024-06-01 05:38:25] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 3 ms to minimize.
SMT process timed out in 10941ms, After SMT, problems are : Problem set: 1 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1052 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 1356 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.5 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 59 ms. Remains 1356 /1398 variables (removed 42) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 1356/1398 places, 296/296 transitions.
RANDOM walk for 40000 steps (1764 resets) in 893 ms. (44 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (119 resets) in 2114 ms. (18 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (122 resets) in 144 ms. (275 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (125 resets) in 145 ms. (273 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (130 resets) in 249 ms. (160 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (128 resets) in 74 ms. (533 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (98 resets) in 256 ms. (155 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (96 resets) in 101 ms. (392 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (95 resets) in 61 ms. (645 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (90 resets) in 347 ms. (114 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (95 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (127 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (121 resets) in 136 ms. (291 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (126 resets) in 89 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (94 resets) in 64 ms. (615 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 504879 steps, run timeout after 3001 ms. (steps per millisecond=168 ) properties seen :0 out of 14
Probabilistic random walk after 504879 steps, saw 74800 distinct states, run finished after 3001 ms. (steps per millisecond=168 ) properties seen :0
// Phase 1: matrix 296 rows 1356 cols
[2024-06-01 05:38:30] [INFO ] Computed 1062 invariants in 33 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1052 variables, 381/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1052 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (OVERLAPS) 94/1146 variables, 471/852 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1146 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 210/1356 variables, 210/1062 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1356 variables, 0/1062 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-01 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-06 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-09 is UNSAT
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 296/1652 variables, 1356/2418 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/1652 variables, 0/2418 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1652/1652 variables, and 2418 constraints, problems are : Problem set: 3 solved, 11 unsolved in 4988 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/976 variables, 360/360 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/976 variables, 0/360 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 45/1021 variables, 378/738 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1021 variables, 0/738 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 335/1356 variables, 324/1062 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1356 variables, 0/1062 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 296/1652 variables, 1356/2418 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1652 variables, 11/2429 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1652 variables, 0/2429 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/1652 variables, 0/2429 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1652/1652 variables, and 2429 constraints, problems are : Problem set: 3 solved, 11 unsolved in 45016 ms.
Refiners :[Generalized P Invariants (flows): 1062/1062 constraints, State Equation: 1356/1356 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 50559ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 6 different solutions.
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-00 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-08 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 10 properties in 596 ms.
Support contains 20 out of 1356 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1356/1356 places, 296/296 transitions.
Graph (complete) has 9049 edges and 1356 vertex of which 976 are kept as prefixes of interest. Removing 380 places using SCC suffix rule.4 ms
Discarding 380 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Drop transitions (Empty/Sink Transition effects.) removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 195 rules applied. Total rules applied 196 place count 938 transition count 119
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 217 place count 917 transition count 119
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 57 Pre rules applied. Total rules applied 217 place count 917 transition count 62
Deduced a syphon composed of 57 places in 1 ms
Ensure Unique test removed 56 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 387 place count 804 transition count 62
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 388 place count 804 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 389 place count 803 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 389 place count 803 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 392 place count 801 transition count 60
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 342 places
Reduce places removed 361 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 772 place count 440 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 773 place count 439 transition count 40
Ensure Unique test removed 19 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 792 place count 420 transition count 40
Reduce places removed 18 places and 18 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 810 place count 402 transition count 22
Ensure Unique test removed 342 places
Iterating post reduction 5 with 342 rules applied. Total rules applied 1152 place count 60 transition count 22
Applied a total of 1152 rules in 151 ms. Remains 60 /1356 variables (removed 1296) and now considering 22/296 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 60/1356 places, 22/296 transitions.
RANDOM walk for 2236 steps (98 resets) in 36 ms. (60 steps per ms) remains 0/1 properties
FORMULA QuasiCertifProtocol-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 71285 ms.
ITS solved all properties within timeout

BK_STOP 1717220361662

--------------------
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-18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is QuasiCertifProtocol-PT-18, 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 r520-tall-171662337800087"
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 [ "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 ;