fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r504-tall-171649612000078
Last Updated
July 7, 2024

About the Execution of LTSMin+red for JoinFreeModules-PT-1000

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3852.655 96544.00 144575.00 220.60 FFTTTTTTFTFFTFTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.2K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 11 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 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 3.1M 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-1000-ReachabilityCardinality-2024-00
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-01
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-02
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-03
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-04
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-05
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-06
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-07
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-08
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-09
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-10
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-11
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-12
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-13
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-14
FORMULA_NAME JoinFreeModules-PT-1000-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717220885106

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-1000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:48:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:48:06] [INFO ] Load time of PNML (sax parser for PT used): 309 ms
[2024-06-01 05:48:06] [INFO ] Transformed 5001 places.
[2024-06-01 05:48:06] [INFO ] Transformed 8001 transitions.
[2024-06-01 05:48:06] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 442 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40062 steps (8 resets) in 3093 ms. (12 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3410 ms. (11 steps per ms) remains 10/11 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2270 ms. (17 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2459 ms. (16 steps per ms) remains 9/10 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1855 ms. (21 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2029 ms. (19 steps per ms) remains 8/9 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 2178 ms. (18 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1852 ms. (21 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1903 ms. (21 steps per ms) remains 7/8 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1808 ms. (22 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1836 ms. (21 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1854 ms. (21 steps per ms) remains 7/7 properties
// Phase 1: matrix 8001 rows 5000 cols
[2024-06-01 05:48:14] [INFO ] Computed 1000 invariants in 59 ms
[2024-06-01 05:48:14] [INFO ] State equation strengthened by 1000 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 705/895 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1432/2327 variables, 895/1074 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2327 variables, 179/1253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2327 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/2327 variables, 0/1253 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2327/13001 variables, and 1253 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1557 ms.
Refiners :[Positive P Invariants (semi-flows): 179/1000 constraints, State Equation: 895/5000 constraints, ReadFeed: 179/1000 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/190 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 705/895 variables, 179/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 28 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 3 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 3 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 1 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/895 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/895 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:48:20] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
SMT process timed out in 6914ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 190 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 895 are kept as prefixes of interest. Removing 4105 places using SCC suffix rule.15 ms
Discarding 4105 places :
Also discarding 6568 output transitions
Drop transitions (Output transitions of discarded places.) removed 6568 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 895 transition count 1432
Applied a total of 2 rules in 141 ms. Remains 895 /5000 variables (removed 4105) and now considering 1432/8001 (removed 6569) transitions.
Running 1074 sub problems to find dead transitions.
// Phase 1: matrix 1432 rows 895 cols
[2024-06-01 05:48:21] [INFO ] Computed 179 invariants in 5 ms
[2024-06-01 05:48:21] [INFO ] State equation strengthened by 179 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/716 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1074 unsolved
SMT process timed out in 20312ms, After SMT, problems are : Problem set: 0 solved, 1074 unsolved
Search for dead transitions found 0 dead transitions in 20327ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20500 ms. Remains : 895/5000 places, 1432/8001 transitions.
RANDOM walk for 40562 steps (8 resets) in 447 ms. (90 steps per ms) remains 6/7 properties
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 518 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 647 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 629 ms. (63 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 6/6 properties
[2024-06-01 05:48:42] [INFO ] Invariant cache hit.
[2024-06-01 05:48:42] [INFO ] State equation strengthened by 179 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 694/880 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1408/2288 variables, 880/1056 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2288 variables, 176/1232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2288 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/2288 variables, 0/1232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2288/2327 variables, and 1232 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 176/179 constraints, State Equation: 880/895 constraints, ReadFeed: 176/179 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 694/880 variables, 176/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:48:43] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:48:43] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:48:43] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 6 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-06-01 05:48:44] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/880 variables, 20/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:48:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:48:46] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/880 variables, 20/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:48:47] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/880 variables, 20/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:48:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/880 variables, 18/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/880 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1408/2288 variables, 880/1134 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2288 variables, 176/1310 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2288 variables, 6/1316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:48:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:49:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2288 variables, 16/1332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2288 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/2288 variables, 0/1332 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2288/2327 variables, and 1332 constraints, problems are : Problem set: 0 solved, 6 unsolved in 19605 ms.
Refiners :[Positive P Invariants (semi-flows): 176/179 constraints, State Equation: 880/895 constraints, ReadFeed: 176/179 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 94/94 constraints]
After SMT, in 20700ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-15 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-12 TRUE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 5 properties in 30007 ms.
Support contains 79 out of 895 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 895/895 places, 1432/1432 transitions.
Graph (complete) has 2148 edges and 895 vertex of which 380 are kept as prefixes of interest. Removing 515 places using SCC suffix rule.3 ms
Discarding 515 places :
Also discarding 824 output transitions
Drop transitions (Output transitions of discarded places.) removed 824 transitions
Applied a total of 1 rules in 33 ms. Remains 380 /895 variables (removed 515) and now considering 608/1432 (removed 824) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 380/895 places, 608/1432 transitions.
RANDOM walk for 40730 steps (8 resets) in 213 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 360 ms. (110 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 423577 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 423577 steps, saw 419355 distinct states, run finished after 3005 ms. (steps per millisecond=140 ) properties seen :0
// Phase 1: matrix 608 rows 380 cols
[2024-06-01 05:49:36] [INFO ] Computed 76 invariants in 2 ms
[2024-06-01 05:49:36] [INFO ] State equation strengthened by 76 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 301/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 608/988 variables, 380/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/988 variables, 76/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/988 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/988 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 988/988 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 380/380 constraints, ReadFeed: 76/76 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 301/380 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:49:36] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 2 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/380 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:49:37] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:49:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/380 variables, 14/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/380 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 608/988 variables, 380/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 76/566 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/988 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:39] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:49:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:49:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/988 variables, 7/574 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:49:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/988 variables, 2/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/988 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/988 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 988/988 variables, and 576 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4420 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, State Equation: 380/380 constraints, ReadFeed: 76/76 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 43/43 constraints]
After SMT, in 4702ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65336 steps, including 0 resets, run visited all 1 properties in 552 ms. (steps per millisecond=118 )
FORMULA JoinFreeModules-PT-1000-ReachabilityCardinality-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 556 ms.
All properties solved without resorting to model-checking.
Total runtime 95348 ms.
ITS solved all properties within timeout

BK_STOP 1717220981650

--------------------
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 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-1000"
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-1000, 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-171649612000078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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