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.r223-tall-171649610700086.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 JoinFreeModules-PT-2000, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-171649610700086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 9.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K 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 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 14:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 11 14:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 11 14:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 11 14:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 6.2M 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 JoinFreeModules-PT-2000-ReachabilityCardinality-2024-00
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-01
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-04
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-06
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-07
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-08
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-09
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-10
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-11
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-12
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-13
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-14
FORMULA_NAME JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716508263089

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 23:51:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 23:51:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 23:51:04] [INFO ] Load time of PNML (sax parser for PT used): 442 ms
[2024-05-23 23:51:04] [INFO ] Transformed 10001 places.
[2024-05-23 23:51:04] [INFO ] Transformed 16001 transitions.
[2024-05-23 23:51:04] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 597 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 41034 steps (8 resets) in 4453 ms. (9 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3952 ms. (10 steps per ms) remains 11/12 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4725 ms. (8 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4042 ms. (9 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3820 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4401 ms. (9 steps per ms) remains 10/11 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4278 ms. (9 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4726 ms. (8 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4355 ms. (9 steps per ms) remains 9/10 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4268 ms. (9 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3830 ms. (10 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 3828 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3909 ms. (10 steps per ms) remains 8/8 properties
// Phase 1: matrix 16001 rows 10000 cols
[2024-05-23 23:51:19] [INFO ] Computed 2000 invariants in 90 ms
[2024-05-23 23:51:19] [INFO ] State equation strengthened by 2000 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 639/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1288/2093 variables, 805/966 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2093 variables, 161/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2093 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/2093 variables, 0/1127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2093/26001 variables, and 1127 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1455 ms.
Refiners :[Positive P Invariants (semi-flows): 161/2000 constraints, State Equation: 805/10000 constraints, ReadFeed: 161/2000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 639/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 24 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 3 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 3 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 2 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 2 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-23 23:51:22] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2024-05-23 23:51:23] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 4 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/805 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-05-23 23:51:24] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 4 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 23:51:25] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/805 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-05-23 23:51:26] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
SMT process timed out in 6906ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 166 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 805 are kept as prefixes of interest. Removing 9195 places using SCC suffix rule.24 ms
Discarding 9195 places :
Also discarding 14712 output transitions
Drop transitions (Output transitions of discarded places.) removed 14712 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 805 transition count 1288
Applied a total of 2 rules in 151 ms. Remains 805 /10000 variables (removed 9195) and now considering 1288/16001 (removed 14713) transitions.
Running 966 sub problems to find dead transitions.
// Phase 1: matrix 1288 rows 805 cols
[2024-05-23 23:51:26] [INFO ] Computed 161 invariants in 5 ms
[2024-05-23 23:51:26] [INFO ] State equation strengthened by 161 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (OVERLAPS) 161/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/2093 variables, and 161 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20054 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/805 constraints, ReadFeed: 0/161 constraints, PredecessorRefiner: 966/966 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 966 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/644 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 966 unsolved
At refinement iteration 1 (OVERLAPS) 161/805 variables, 161/161 constraints. Problems are: Problem set: 0 solved, 966 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/2093 variables, and 161 constraints, problems are : Problem set: 0 solved, 966 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/805 constraints, ReadFeed: 0/161 constraints, PredecessorRefiner: 0/966 constraints, Known Traps: 0/0 constraints]
After SMT, in 40323ms problems are : Problem set: 0 solved, 966 unsolved
Search for dead transitions found 0 dead transitions in 40335ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40510 ms. Remains : 805/10000 places, 1288/16001 transitions.
RANDOM walk for 42037 steps (8 resets) in 380 ms. (110 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 504 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 576 ms. (69 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 503 ms. (79 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 399 ms. (100 steps per ms) remains 7/7 properties
[2024-05-23 23:52:08] [INFO ] Invariant cache hit.
[2024-05-23 23:52:08] [INFO ] State equation strengthened by 161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/775 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/775 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1240/2015 variables, 775/930 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2015 variables, 155/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2015 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/2015 variables, 0/1085 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2015/2093 variables, and 1085 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 155/161 constraints, State Equation: 775/805 constraints, ReadFeed: 155/161 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 615/775 variables, 155/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:52:09] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-23 23:52:09] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-23 23:52:09] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-23 23:52:09] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-23 23:52:09] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-05-23 23:52:10] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/775 variables, 20/175 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-23 23:52:11] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/775 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 23:52:12] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/775 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-05-23 23:52:13] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-23 23:52:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/775 variables, 17/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/775 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1240/2015 variables, 775/1007 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2015 variables, 155/1162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2015 variables, 7/1169 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-23 23:52:22] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-23 23:52:23] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2015 variables, 7/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2015 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/2015 variables, 0/1176 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2015/2093 variables, and 1176 constraints, problems are : Problem set: 0 solved, 7 unsolved in 16065 ms.
Refiners :[Positive P Invariants (semi-flows): 155/161 constraints, State Equation: 775/805 constraints, ReadFeed: 155/161 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 84/84 constraints]
After SMT, in 17139ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Finished Parikh walk after 295235 steps, including 0 resets, run visited all 7 properties in 9100 ms. (steps per millisecond=32 )
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-06 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-05 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-03 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-02 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityCardinality-2024-01 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 9110 ms.
All properties solved without resorting to model-checking.
Total runtime 90262 ms.
ITS solved all properties within timeout

BK_STOP 1716508354656

--------------------
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="JoinFreeModules-PT-2000"
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 JoinFreeModules-PT-2000, 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 r223-tall-171649610700086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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