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-171636265000102.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-d02r19, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r157-smll-171636265000102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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.3K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 04:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Apr 12 04:44 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 1.5M 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-d02r19-ReachabilityCardinality-2024-00
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-01
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-02
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-03
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-04
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-05
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-06
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-07
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-08
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-09
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-10
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-11
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-12
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-13
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-14
FORMULA_NAME Echo-PT-d02r19-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716435633104

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d02r19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 03:40:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 03:40:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 03:40:36] [INFO ] Load time of PNML (sax parser for PT used): 707 ms
[2024-05-23 03:40:36] [INFO ] Transformed 3455 places.
[2024-05-23 03:40:36] [INFO ] Transformed 2730 transitions.
[2024-05-23 03:40:36] [INFO ] Found NUPN structural information;
[2024-05-23 03:40:36] [INFO ] Parsed PT model containing 3455 places and 2730 transitions and 15940 arcs in 972 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (52 resets) in 4173 ms. (9 steps per ms) remains 3/14 properties
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 912 ms. (43 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1558 ms. (25 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1001 ms. (39 steps per ms) remains 3/3 properties
// Phase 1: matrix 2730 rows 3455 cols
[2024-05-23 03:40:39] [INFO ] Computed 1729 invariants in 603 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 129/205 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 129/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/220 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 15/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1694/1914 variables, 574/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1914 variables, 1694/2520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1914 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 201/2115 variables, 136/2656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2115 variables, 201/2857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2115 variables, 0/2857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1122/3237 variables, 801/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3237 variables, 1122/4780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3237 variables, 0/4780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 58/3295 variables, 58/4838 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3295 variables, 58/4896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3295 variables, 0/4896 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 149/3444 variables, 117/5013 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3444 variables, 149/5162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3444 variables, 0/5162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 7/3451 variables, 7/5169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3451 variables, 7/5176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3451 variables, 0/5176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 4/3455 variables, 4/5180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3455 variables, 4/5184 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3455/6185 variables, and 5184 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5083 ms.
Refiners :[Domain max(s): 3455/3455 constraints, Positive P Invariants (semi-flows): 233/233 constraints, Generalized P Invariants (flows): 1496/1496 constraints, State Equation: 0/3455 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 129/205 variables, 28/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 129/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/220 variables, 4/237 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 15/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1694/1914 variables, 574/826 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1914 variables, 1694/2520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1914 variables, 0/2520 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 201/2115 variables, 136/2656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2115 variables, 201/2857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2115 variables, 0/2857 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 1122/3237 variables, 801/3658 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3237 variables, 1122/4780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 03:40:49] [INFO ] Deduced a trap composed of 11 places in 1916 ms of which 225 ms to minimize.
[2024-05-23 03:40:50] [INFO ] Deduced a trap composed of 15 places in 1698 ms of which 15 ms to minimize.
SMT process timed out in 12086ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 3455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3455/3455 places, 2730/2730 transitions.
Graph (complete) has 12066 edges and 3455 vertex of which 3093 are kept as prefixes of interest. Removing 362 places using SCC suffix rule.20 ms
Discarding 362 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 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 3093 transition count 2726
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 3092 transition count 2725
Applied a total of 5 rules in 1090 ms. Remains 3092 /3455 variables (removed 363) and now considering 2725/2730 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1106 ms. Remains : 3092/3455 places, 2725/2730 transitions.
RANDOM walk for 40000 steps (52 resets) in 1414 ms. (28 steps per ms) remains 2/3 properties
FORMULA Echo-PT-d02r19-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 773 ms. (51 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 797 ms. (50 steps per ms) remains 2/2 properties
// Phase 1: matrix 2725 rows 3092 cols
[2024-05-23 03:41:00] [INFO ] Computed 1368 invariants in 7832 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 57/114 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 57/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2571/2685 variables, 978/1109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2685 variables, 2571/3680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2685 variables, 0/3680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/2688 variables, 3/3683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2688 variables, 3/3686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2688 variables, 0/3686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 404/3092 variables, 370/4056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3092 variables, 404/4460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3092 variables, 0/4460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5817/5817 variables, and 7552 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45033 ms.
Refiners :[Domain max(s): 3092/3092 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1348/1348 constraints, State Equation: 3092/3092 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/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 57/114 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 57/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2571/2685 variables, 978/1109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2685 variables, 2571/3680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2685 variables, 0/3680 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/2688 variables, 3/3683 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2688 variables, 3/3686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2688 variables, 0/3686 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 404/3092 variables, 370/4056 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3092 variables, 404/4460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3092 variables, 0/4460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5817/5817 variables, and 7552 constraints, problems are : Problem set: 0 solved, 2 unsolved in 45031 ms.
Refiners :[Domain max(s): 3092/3092 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 1348/1348 constraints, State Equation: 3092/3092 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 98217ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 3092 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3092/3092 places, 2725/2725 transitions.
Graph (complete) has 9348 edges and 3092 vertex of which 3091 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 279 ms. Remains 3091 /3092 variables (removed 1) and now considering 2725/2725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 3091/3092 places, 2725/2725 transitions.
RANDOM walk for 40000 steps (52 resets) in 1869 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 667 ms. (59 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 647 ms. (61 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 141607 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 2
Probabilistic random walk after 141607 steps, saw 65076 distinct states, run finished after 3009 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 2725 rows 3091 cols
[2024-05-23 03:42:39] [INFO ] Computed 1367 invariants in 4203 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 47/104 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2723/2827 variables, 1093/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2827 variables, 2723/3933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2827 variables, 0/3933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 264/3091 variables, 261/4194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3091 variables, 264/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3091 variables, 0/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5816/5816 variables, and 7549 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75026 ms.
Refiners :[Domain max(s): 3091/3091 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1354/1354 constraints, State Equation: 3091/3091 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/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 47/104 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 47/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2723/2827 variables, 1093/1210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2827 variables, 2723/3933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2827 variables, 0/3933 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 264/3091 variables, 261/4194 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3091 variables, 264/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3091 variables, 0/4458 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5816/5816 variables, and 7549 constraints, problems are : Problem set: 0 solved, 2 unsolved in 75034 ms.
Refiners :[Domain max(s): 3091/3091 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1354/1354 constraints, State Equation: 3091/3091 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 154505ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 3091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3091/3091 places, 2725/2725 transitions.
Applied a total of 0 rules in 436 ms. Remains 3091 /3091 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 436 ms. Remains : 3091/3091 places, 2725/2725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3091/3091 places, 2725/2725 transitions.
Applied a total of 0 rules in 370 ms. Remains 3091 /3091 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
[2024-05-23 03:45:10] [INFO ] Invariant cache hit.
[2024-05-23 03:45:40] [INFO ] Implicit Places using invariants in 29920 ms returned [656, 2456, 2522, 2526]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 29945 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3087/3091 places, 2725/2725 transitions.
Applied a total of 0 rules in 335 ms. Remains 3087 /3087 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 30654 ms. Remains : 3087/3091 places, 2725/2725 transitions.
RANDOM walk for 40000 steps (52 resets) in 2322 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 521 ms. (76 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 511 ms. (78 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 126585 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126585 steps, saw 62114 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
// Phase 1: matrix 2725 rows 3087 cols
[2024-05-23 03:45:50] [INFO ] Computed 1363 invariants in 5143 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 46/103 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2673/2776 variables, 1046/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2776 variables, 2673/3835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2776 variables, 0/3835 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 311/3087 variables, 304/4139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3087 variables, 311/4450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3087 variables, 0/4450 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5812/5812 variables, and 7537 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90032 ms.
Refiners :[Domain max(s): 3087/3087 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1350/1350 constraints, State Equation: 3087/3087 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/57 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 46/103 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 46/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2673/2776 variables, 1046/1162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2776/5812 variables, and 3835 constraints, problems are : Problem set: 0 solved, 2 unsolved in 90018 ms.
Refiners :[Domain max(s): 2776/3087 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 1046/1350 constraints, State Equation: 0/3087 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 185306ms problems are : Problem set: 0 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 3087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3087/3087 places, 2725/2725 transitions.
Applied a total of 0 rules in 194 ms. Remains 3087 /3087 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 194 ms. Remains : 3087/3087 places, 2725/2725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3087/3087 places, 2725/2725 transitions.
Applied a total of 0 rules in 196 ms. Remains 3087 /3087 variables (removed 0) and now considering 2725/2725 (removed 0) transitions.
[2024-05-23 03:48:50] [INFO ] Invariant cache hit.
[2024-05-23 03:49:20] [INFO ] Implicit Places using invariants in 29356 ms returned []
[2024-05-23 03:49:20] [INFO ] Invariant cache hit.
[2024-05-23 03:49:47] [INFO ] Implicit Places using invariants and state equation in 26992 ms returned []
Implicit Place search using SMT with State Equation took 56356 ms to find 0 implicit places.
[2024-05-23 03:49:47] [INFO ] Redundant transitions in 288 ms returned []
Running 2721 sub problems to find dead transitions.
[2024-05-23 03:49:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3081 variables, 3081/3081 constraints. Problems are: Problem set: 0 solved, 2721 unsolved
SMT process timed out in 32083ms, After SMT, problems are : Problem set: 0 solved, 2721 unsolved
Search for dead transitions found 0 dead transitions in 32150ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89034 ms. Remains : 3087/3087 places, 2725/2725 transitions.
[2024-05-23 03:50:19] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2024-05-23 03:50:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3087 places, 2725 transitions and 14536 arcs took 49 ms.
[2024-05-23 03:50:20] [INFO ] Flatten gal took : 748 ms
Total runtime 585632 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Echo-PT-d02r19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3087
TRANSITIONS: 2725
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.095s, Sys 0.018s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.017s, 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: 616
MODEL NAME: /home/mcc/execution/412/model
3087 places, 2725 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r19"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r19.tgz
mv Echo-PT-d02r19 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;