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.r157-smll-171636265000087.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 Echo-PT-d02r11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265000087
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 916K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 469K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716416688301

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:24:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:24:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:24:51] [INFO ] Load time of PNML (sax parser for PT used): 519 ms
[2024-05-22 22:24:51] [INFO ] Transformed 1119 places.
[2024-05-22 22:24:51] [INFO ] Transformed 874 transitions.
[2024-05-22 22:24:51] [INFO ] Found NUPN structural information;
[2024-05-22 22:24:51] [INFO ] Parsed PT model containing 1119 places and 874 transitions and 4996 arcs in 767 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (164 resets) in 3517 ms. (11 steps per ms) remains 2/16 properties
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1008 ms. (39 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2817 ms. (14 steps per ms) remains 2/2 properties
// Phase 1: matrix 874 rows 1119 cols
[2024-05-22 22:24:53] [INFO ] Computed 561 invariants in 121 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 142/266 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 142/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/270 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 418/688 variables, 185/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 418/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/735 variables, 43/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 47/1021 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/735 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 358/1093 variables, 249/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1093 variables, 358/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1093 variables, 0/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 16/1109 variables, 16/1644 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1109 variables, 16/1660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1109 variables, 0/1660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 10/1119 variables, 10/1670 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1119 variables, 10/1680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1119 variables, 0/1680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 874/1993 variables, 1119/2799 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1993 variables, 0/2799 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/1993 variables, 0/2799 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1993/1993 variables, and 2799 constraints, problems are : Problem set: 0 solved, 2 unsolved in 3013 ms.
Refiners :[Domain max(s): 1119/1119 constraints, Positive P Invariants (semi-flows): 94/94 constraints, Generalized P Invariants (flows): 467/467 constraints, State Equation: 1119/1119 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 124/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 142/266 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 142/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/270 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 418/688 variables, 185/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 418/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/931 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 47/735 variables, 43/974 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 47/1021 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/735 variables, 0/1021 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 358/1093 variables, 249/1270 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1093 variables, 358/1628 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 22:24:59] [INFO ] Deduced a trap composed of 12 places in 661 ms of which 96 ms to minimize.
[2024-05-22 22:24:59] [INFO ] Deduced a trap composed of 13 places in 715 ms of which 12 ms to minimize.
[2024-05-22 22:25:00] [INFO ] Deduced a trap composed of 10 places in 586 ms of which 10 ms to minimize.
[2024-05-22 22:25:01] [INFO ] Deduced a trap composed of 10 places in 656 ms of which 9 ms to minimize.
[2024-05-22 22:25:01] [INFO ] Deduced a trap composed of 25 places in 612 ms of which 9 ms to minimize.
[2024-05-22 22:25:02] [INFO ] Deduced a trap composed of 18 places in 547 ms of which 6 ms to minimize.
SMT process timed out in 8886ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 124 out of 1119 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1119/1119 places, 874/874 transitions.
Graph (complete) has 3810 edges and 1119 vertex of which 992 are kept as prefixes of interest. Removing 127 places using SCC suffix rule.9 ms
Discarding 127 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 992 transition count 872
Applied a total of 2 rules in 169 ms. Remains 992 /1119 variables (removed 127) and now considering 872/874 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 992/1119 places, 872/874 transitions.
RANDOM walk for 40000 steps (164 resets) in 1532 ms. (26 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 617 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 890 ms. (44 steps per ms) remains 1/2 properties
FORMULA Echo-PT-d02r11-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 872 rows 992 cols
[2024-05-22 22:25:04] [INFO ] Computed 435 invariants in 793 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 813/847 variables, 294/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 813/1141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/992 variables, 141/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/992 variables, 145/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/992 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 872/1864 variables, 992/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1864 variables, 0/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1864/1864 variables, and 2419 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3434 ms.
Refiners :[Domain max(s): 992/992 constraints, Generalized P Invariants (flows): 435/435 constraints, State Equation: 992/992 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/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 813/847 variables, 294/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/847 variables, 813/1141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/847 variables, 0/1141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 145/992 variables, 141/1282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/992 variables, 145/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/992 variables, 0/1427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 872/1864 variables, 992/2419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1864 variables, 1/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1864 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1864 variables, 0/2420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1864/1864 variables, and 2420 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3957 ms.
Refiners :[Domain max(s): 992/992 constraints, Generalized P Invariants (flows): 435/435 constraints, State Equation: 992/992 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8295ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 992/992 places, 872/872 transitions.
Graph (complete) has 2910 edges and 992 vertex of which 989 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 989 transition count 869
Applied a total of 4 rules in 98 ms. Remains 989 /992 variables (removed 3) and now considering 869/872 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 989/992 places, 869/872 transitions.
RANDOM walk for 40000 steps (164 resets) in 685 ms. (58 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 533 ms. (74 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 547826 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 1
Probabilistic random walk after 547826 steps, saw 107371 distinct states, run finished after 3007 ms. (steps per millisecond=182 ) properties seen :0
// Phase 1: matrix 869 rows 989 cols
[2024-05-22 22:25:16] [INFO ] Computed 432 invariants in 513 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 833/867 variables, 312/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 833/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/989 variables, 120/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 122/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 869/1858 variables, 989/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1858 variables, 0/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1858 variables, 0/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1858/1858 variables, and 2410 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2749 ms.
Refiners :[Domain max(s): 989/989 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 989/989 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/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 833/867 variables, 312/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/867 variables, 833/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/867 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 122/989 variables, 120/1299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/989 variables, 122/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/989 variables, 0/1421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 869/1858 variables, 989/2410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1858 variables, 1/2411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1858 variables, 0/2411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1858 variables, 0/2411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1858/1858 variables, and 2411 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4036 ms.
Refiners :[Domain max(s): 989/989 constraints, Generalized P Invariants (flows): 432/432 constraints, State Equation: 989/989 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 7371ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 34 out of 989 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 869/869 transitions.
Applied a total of 0 rules in 83 ms. Remains 989 /989 variables (removed 0) and now considering 869/869 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 989/989 places, 869/869 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 989/989 places, 869/869 transitions.
Applied a total of 0 rules in 78 ms. Remains 989 /989 variables (removed 0) and now considering 869/869 (removed 0) transitions.
[2024-05-22 22:25:23] [INFO ] Invariant cache hit.
[2024-05-22 22:25:30] [INFO ] Implicit Places using invariants in 7547 ms returned []
[2024-05-22 22:25:30] [INFO ] Invariant cache hit.
[2024-05-22 22:25:41] [INFO ] Implicit Places using invariants and state equation in 10917 ms returned []
Implicit Place search using SMT with State Equation took 18489 ms to find 0 implicit places.
[2024-05-22 22:25:41] [INFO ] Redundant transitions in 55 ms returned []
Running 868 sub problems to find dead transitions.
[2024-05-22 22:25:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 428/1416 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 988/1858 variables, and 1416 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30072 ms.
Refiners :[Domain max(s): 988/989 constraints, Generalized P Invariants (flows): 428/432 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/988 variables, 988/988 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/988 variables, 428/1416 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 988/1858 variables, and 1416 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30037 ms.
Refiners :[Domain max(s): 988/989 constraints, Generalized P Invariants (flows): 428/432 constraints, State Equation: 0/989 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 0/0 constraints]
After SMT, in 60827ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60847ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79488 ms. Remains : 989/989 places, 869/869 transitions.
[2024-05-22 22:26:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-22 22:26:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 989 places, 869 transitions and 4517 arcs took 22 ms.
[2024-05-22 22:26:43] [INFO ] Flatten gal took : 354 ms
Total runtime 112666 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Echo-PT-d02r11

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.008s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 606
MODEL NAME: /home/mcc/execution/413/model
989 places, 869 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="Echo-PT-d02r11"
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 Echo-PT-d02r11, 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 r157-smll-171636265000087"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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