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-171649612000087.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-2000, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612000087
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1717222416109

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-2000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:13:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:13:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:13:37] [INFO ] Load time of PNML (sax parser for PT used): 471 ms
[2024-06-01 06:13:37] [INFO ] Transformed 10001 places.
[2024-06-01 06:13:37] [INFO ] Transformed 16001 transitions.
[2024-06-01 06:13:37] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 643 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 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-2000-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 41034 steps (8 resets) in 5753 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5211 ms. (7 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4747 ms. (8 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3694 ms. (10 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 4755 ms. (8 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5124 ms. (7 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4044 ms. (9 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3645 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3799 ms. (10 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3574 ms. (11 steps per ms) remains 8/8 properties
// Phase 1: matrix 16001 rows 10000 cols
[2024-06-01 06:13:50] [INFO ] Computed 2000 invariants in 90 ms
[2024-06-01 06:13:50] [INFO ] State equation strengthened by 2000 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 300/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 975/26001 variables, and 525 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1170 ms.
Refiners :[Positive P Invariants (semi-flows): 75/2000 constraints, State Equation: 375/10000 constraints, ReadFeed: 75/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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 300/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:13:51] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 14 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 2 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:13:52] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 0 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2024-06-01 06:13:53] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/375 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 06:13:54] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 600/975 variables, 375/493 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/975 variables, 75/568 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/975 variables, 8/576 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2024-06-01 06:13:56] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 975/26001 variables, and 582 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 75/2000 constraints, State Equation: 375/10000 constraints, ReadFeed: 75/2000 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 49/49 constraints]
After SMT, in 6511ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 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 375 are kept as prefixes of interest. Removing 9625 places using SCC suffix rule.22 ms
Discarding 9625 places :
Also discarding 15400 output transitions
Drop transitions (Output transitions of discarded places.) removed 15400 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 375 transition count 600
Applied a total of 2 rules in 114 ms. Remains 375 /10000 variables (removed 9625) and now considering 600/16001 (removed 15401) transitions.
Running 450 sub problems to find dead transitions.
// Phase 1: matrix 600 rows 375 cols
[2024-06-01 06:13:56] [INFO ] Computed 75 invariants in 5 ms
[2024-06-01 06:13:56] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 75/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 975/975 variables, and 525 constraints, problems are : Problem set: 0 solved, 450 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 375/375 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 75/375 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/375 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (OVERLAPS) 600/975 variables, 375/450 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/975 variables, 75/525 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/975 variables, 450/975 constraints. Problems are: Problem set: 0 solved, 450 unsolved
[2024-06-01 06:14:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:14:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:14:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 975/975 variables, and 980 constraints, problems are : Problem set: 0 solved, 450 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, State Equation: 375/375 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 5/5 constraints]
After SMT, in 40128ms problems are : Problem set: 0 solved, 450 unsolved
Search for dead transitions found 0 dead transitions in 40134ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40264 ms. Remains : 375/10000 places, 600/16001 transitions.
RANDOM walk for 42035 steps (8 resets) in 193 ms. (216 steps per ms) remains 6/8 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 5/6 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 4/5 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 339 ms. (117 steps per ms) remains 3/4 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 2/3 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/2 properties
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-01 06:14:37] [INFO ] Invariant cache hit.
[2024-06-01 06:14:37] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/140 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 224/364 variables, 140/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 28/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/364 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/975 variables, and 196 constraints, problems are : Problem set: 0 solved, 1 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 28/75 constraints, State Equation: 140/375 constraints, ReadFeed: 28/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 112/140 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 06:14:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 17/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/140 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 224/364 variables, 140/185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 28/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:14:38] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/364 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 364/975 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 28/75 constraints, State Equation: 140/375 constraints, ReadFeed: 28/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 19/19 constraints]
After SMT, in 1277ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 115 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=23 )
FORMULA JoinFreeModules-PT-2000-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 12 ms.
All properties solved without resorting to model-checking.
Total runtime 61582 ms.
ITS solved all properties within timeout

BK_STOP 1717222478894

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-2000, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649612000087"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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