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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.6K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:50 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:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:50 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 613K 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-0200-ReachabilityCardinality-2024-00
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-01
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-02
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-03
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-04
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-05
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-06
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-07
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-08
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-09
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-10
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-11
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-12
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-13
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-14
FORMULA_NAME JoinFreeModules-PT-0200-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219167236

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:19:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:19:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:19:28] [INFO ] Load time of PNML (sax parser for PT used): 137 ms
[2024-06-01 05:19:28] [INFO ] Transformed 1001 places.
[2024-06-01 05:19:28] [INFO ] Transformed 1601 transitions.
[2024-06-01 05:19:28] [INFO ] Parsed PT model containing 1001 places and 1601 transitions and 4602 arcs in 255 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40419 steps (8 resets) in 1312 ms. (30 steps per ms) remains 7/9 properties
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 875 ms. (45 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 566 ms. (70 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1186 ms. (33 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 527 ms. (75 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 441 ms. (90 steps per ms) remains 7/7 properties
// Phase 1: matrix 1601 rows 1000 cols
[2024-06-01 05:19:30] [INFO ] Computed 200 invariants in 25 ms
[2024-06-01 05:19:30] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 477/685 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1096/1781 variables, 685/822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1781 variables, 137/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1781 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1781 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1781/2601 variables, and 959 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1419 ms.
Refiners :[Positive P Invariants (semi-flows): 137/200 constraints, State Equation: 685/1000 constraints, ReadFeed: 137/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 13 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/208 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 477/685 variables, 137/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 3 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 2 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2024-06-01 05:19:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 3 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/685 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:19:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:19:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:19:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:19:35] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 9/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1096/1781 variables, 685/872 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1781 variables, 137/1009 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1781 variables, 7/1016 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1781/2601 variables, and 1016 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 137/200 constraints, State Equation: 685/1000 constraints, ReadFeed: 137/200 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 50/50 constraints]
After SMT, in 6604ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 208 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 685 are kept as prefixes of interest. Removing 315 places using SCC suffix rule.3 ms
Discarding 315 places :
Also discarding 504 output transitions
Drop transitions (Output transitions of discarded places.) removed 504 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 685 transition count 1096
Applied a total of 2 rules in 78 ms. Remains 685 /1000 variables (removed 315) and now considering 1096/1601 (removed 505) transitions.
Running 822 sub problems to find dead transitions.
// Phase 1: matrix 1096 rows 685 cols
[2024-06-01 05:19:37] [INFO ] Computed 137 invariants in 4 ms
[2024-06-01 05:19:37] [INFO ] State equation strengthened by 137 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 137/685 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 685/1781 variables, and 137 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 0/685 constraints, ReadFeed: 0/137 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 822 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/548 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 1 (OVERLAPS) 137/685 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 3 (OVERLAPS) 1096/1781 variables, 685/822 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1781 variables, 137/959 constraints. Problems are: Problem set: 0 solved, 822 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1781 variables, 822/1781 constraints. Problems are: Problem set: 0 solved, 822 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1781/1781 variables, and 1781 constraints, problems are : Problem set: 0 solved, 822 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 685/685 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 822/822 constraints, Known Traps: 0/0 constraints]
After SMT, in 40280ms problems are : Problem set: 0 solved, 822 unsolved
Search for dead transitions found 0 dead transitions in 40292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40390 ms. Remains : 685/1000 places, 1096/1601 transitions.
RANDOM walk for 40393 steps (8 resets) in 397 ms. (101 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 121861 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 7
Probabilistic random walk after 121861 steps, saw 121201 distinct states, run finished after 3013 ms. (steps per millisecond=40 ) properties seen :0
[2024-06-01 05:20:21] [INFO ] Invariant cache hit.
[2024-06-01 05:20:21] [INFO ] State equation strengthened by 137 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 477/685 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1096/1781 variables, 685/822 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1781 variables, 137/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1781 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/1781 variables, 0/959 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1781/1781 variables, and 959 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1151 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 685/685 constraints, ReadFeed: 137/137 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/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 477/685 variables, 137/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:22] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:20:22] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-06-01 05:20:22] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-06-01 05:20:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/685 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:20:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/685 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 14/191 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:20:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/685 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/685 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1096/1781 variables, 685/878 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1781 variables, 137/1015 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1781 variables, 7/1022 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:20:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1781 variables, 2/1024 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1781 variables, 0/1024 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:20:34] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/1781 variables, 1/1025 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1781 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1781 variables, 0/1025 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1781/1781 variables, and 1025 constraints, problems are : Problem set: 0 solved, 7 unsolved in 13341 ms.
Refiners :[Positive P Invariants (semi-flows): 137/137 constraints, State Equation: 685/685 constraints, ReadFeed: 137/137 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 59/59 constraints]
After SMT, in 14535ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 5 different solutions.
Finished Parikh walk after 86664 steps, including 2 resets, run visited all 7 properties in 1896 ms. (steps per millisecond=45 )
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-10 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-08 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-07 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-ReachabilityCardinality-2024-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
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 1904 ms.
All properties solved without resorting to model-checking.
Total runtime 69386 ms.
ITS solved all properties within timeout

BK_STOP 1717219237822

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0200, 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 r504-tall-171649612000062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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