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.r508-tall-171654350700022.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 MultiCrashLeafsetExtension-PT-S16C04, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654350700022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 05:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 12 05:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 12 05:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 05:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M May 18 16:43 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 MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717195249119

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S16C04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:40:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:40:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:40:50] [INFO ] Load time of PNML (sax parser for PT used): 321 ms
[2024-05-31 22:40:50] [INFO ] Transformed 4260 places.
[2024-05-31 22:40:50] [INFO ] Transformed 6027 transitions.
[2024-05-31 22:40:50] [INFO ] Parsed PT model containing 4260 places and 6027 transitions and 23774 arcs in 452 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (957 resets) in 2092 ms. (19 steps per ms) remains 15/16 properties
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (24 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 66 ms. (59 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 58 ms. (67 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 67 ms. (58 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 165 ms. (24 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 38 ms. (102 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (24 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 32949 steps, run timeout after 3001 ms. (steps per millisecond=10 ) properties seen :0 out of 15
Probabilistic random walk after 32949 steps, saw 15592 distinct states, run finished after 3005 ms. (steps per millisecond=10 ) properties seen :0
[2024-05-31 22:40:54] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2024-05-31 22:40:55] [INFO ] Computed 497 invariants in 283 ms
[2024-05-31 22:40:55] [INFO ] State equation strengthened by 1634 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 695/930 variables, 9/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/930 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 34/964 variables, 32/42 constraints. Problems are: Problem set: 3 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/964 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 12 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-00 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 2583/3547 variables, 247/289 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3547 variables, 0/289 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 5/3552 variables, 5/294 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3552 variables, 0/294 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 693/4245 variables, 188/482 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4245 variables, 0/482 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 15/4260 variables, 15/497 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/4260 variables, 0/497 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 5755/10015 variables, 4260/4757 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/10015 variables, 1634/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/10015 variables, 0/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/10015 variables, 0/6391 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10015/10015 variables, and 6391 constraints, problems are : Problem set: 13 solved, 2 unsolved in 4986 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 451/451 constraints, State Equation: 4260/4260 constraints, ReadFeed: 1634/1634 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 698/743 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/743 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2293/3036 variables, 162/163 constraints. Problems are: Problem set: 13 solved, 2 unsolved
[2024-05-31 22:41:03] [INFO ] Deduced a trap composed of 50 places in 2337 ms of which 146 ms to minimize.
[2024-05-31 22:41:05] [INFO ] Deduced a trap composed of 385 places in 2176 ms of which 26 ms to minimize.
SMT process timed out in 10587ms, After SMT, problems are : Problem set: 13 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 4260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.17 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1065 transitions
Trivial Post-agglo rules discarded 1065 transitions
Performed 1065 trivial Post agglomeration. Transition count delta: 1065
Iterating post reduction 0 with 1065 rules applied. Total rules applied 1066 place count 4232 transition count 4962
Reduce places removed 1065 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 1074 rules applied. Total rules applied 2140 place count 3167 transition count 4953
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 2149 place count 3158 transition count 4953
Performed 136 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 136 Pre rules applied. Total rules applied 2149 place count 3158 transition count 4817
Deduced a syphon composed of 136 places in 8 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 272 rules applied. Total rules applied 2421 place count 3022 transition count 4817
Discarding 929 places :
Symmetric choice reduction at 3 with 929 rule applications. Total rules 3350 place count 2093 transition count 3888
Iterating global reduction 3 with 929 rules applied. Total rules applied 4279 place count 2093 transition count 3888
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4279 place count 2093 transition count 3887
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 4281 place count 2092 transition count 3887
Discarding 210 places :
Symmetric choice reduction at 3 with 210 rule applications. Total rules 4491 place count 1882 transition count 3047
Iterating global reduction 3 with 210 rules applied. Total rules applied 4701 place count 1882 transition count 3047
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 3 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 4733 place count 1866 transition count 3031
Free-agglomeration rule (complex) applied 159 times.
Iterating global reduction 3 with 159 rules applied. Total rules applied 4892 place count 1866 transition count 3379
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 3 with 159 rules applied. Total rules applied 5051 place count 1707 transition count 3379
Partial Free-agglomeration rule applied 119 times.
Drop transitions (Partial Free agglomeration) removed 119 transitions
Iterating global reduction 4 with 119 rules applied. Total rules applied 5170 place count 1707 transition count 3379
Applied a total of 5170 rules in 1823 ms. Remains 1707 /4260 variables (removed 2553) and now considering 3379/6027 (removed 2648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1835 ms. Remains : 1707/4260 places, 3379/6027 transitions.
RANDOM walk for 40000 steps (1519 resets) in 880 ms. (45 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 246 ms. (161 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (272 resets) in 270 ms. (147 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 60999 steps, run timeout after 3001 ms. (steps per millisecond=20 ) properties seen :0 out of 2
Probabilistic random walk after 60999 steps, saw 27392 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-31 22:41:10] [INFO ] Flow matrix only has 2997 transitions (discarded 382 similar events)
// Phase 1: matrix 2997 rows 1707 cols
[2024-05-31 22:41:10] [INFO ] Computed 469 invariants in 77 ms
[2024-05-31 22:41:10] [INFO ] State equation strengthened by 1511 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1045 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 527/1572 variables, 327/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1572 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 28/1600 variables, 28/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1600 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 107/1707 variables, 107/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1707 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2997/4704 variables, 1707/2176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4704 variables, 1511/3687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4704 variables, 0/3687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/4704 variables, 0/3687 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4704/4704 variables, and 3687 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1687 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1707/1707 constraints, ReadFeed: 1511/1511 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1000/1045 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1045 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1045 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08 is UNSAT
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (OVERLAPS) 527/1572 variables, 327/334 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:41:13] [INFO ] Deduced a trap composed of 153 places in 1062 ms of which 17 ms to minimize.
[2024-05-31 22:41:15] [INFO ] Deduced a trap composed of 20 places in 1095 ms of which 11 ms to minimize.
[2024-05-31 22:41:16] [INFO ] Deduced a trap composed of 148 places in 1192 ms of which 11 ms to minimize.
[2024-05-31 22:41:17] [INFO ] Deduced a trap composed of 107 places in 1127 ms of which 10 ms to minimize.
[2024-05-31 22:41:18] [INFO ] Deduced a trap composed of 208 places in 1093 ms of which 10 ms to minimize.
[2024-05-31 22:41:19] [INFO ] Deduced a trap composed of 123 places in 1158 ms of which 10 ms to minimize.
[2024-05-31 22:41:20] [INFO ] Deduced a trap composed of 113 places in 1101 ms of which 11 ms to minimize.
[2024-05-31 22:41:22] [INFO ] Deduced a trap composed of 120 places in 1162 ms of which 12 ms to minimize.
[2024-05-31 22:41:23] [INFO ] Deduced a trap composed of 130 places in 1170 ms of which 10 ms to minimize.
[2024-05-31 22:41:24] [INFO ] Deduced a trap composed of 158 places in 1135 ms of which 10 ms to minimize.
[2024-05-31 22:41:25] [INFO ] Deduced a trap composed of 189 places in 1127 ms of which 10 ms to minimize.
[2024-05-31 22:41:26] [INFO ] Deduced a trap composed of 137 places in 1115 ms of which 10 ms to minimize.
[2024-05-31 22:41:27] [INFO ] Deduced a trap composed of 120 places in 1076 ms of which 10 ms to minimize.
[2024-05-31 22:41:29] [INFO ] Deduced a trap composed of 173 places in 1094 ms of which 9 ms to minimize.
[2024-05-31 22:41:30] [INFO ] Deduced a trap composed of 175 places in 1120 ms of which 10 ms to minimize.
[2024-05-31 22:41:31] [INFO ] Deduced a trap composed of 159 places in 1060 ms of which 10 ms to minimize.
[2024-05-31 22:41:32] [INFO ] Deduced a trap composed of 142 places in 1087 ms of which 9 ms to minimize.
[2024-05-31 22:41:33] [INFO ] Deduced a trap composed of 193 places in 1155 ms of which 10 ms to minimize.
[2024-05-31 22:41:34] [INFO ] Deduced a trap composed of 132 places in 1150 ms of which 11 ms to minimize.
[2024-05-31 22:41:35] [INFO ] Deduced a trap composed of 136 places in 1124 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1572 variables, 20/354 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:41:36] [INFO ] Deduced a trap composed of 204 places in 966 ms of which 9 ms to minimize.
[2024-05-31 22:41:37] [INFO ] Deduced a trap composed of 141 places in 967 ms of which 9 ms to minimize.
[2024-05-31 22:41:38] [INFO ] Deduced a trap composed of 232 places in 931 ms of which 10 ms to minimize.
[2024-05-31 22:41:39] [INFO ] Deduced a trap composed of 274 places in 1026 ms of which 10 ms to minimize.
[2024-05-31 22:41:41] [INFO ] Deduced a trap composed of 114 places in 1176 ms of which 10 ms to minimize.
[2024-05-31 22:41:42] [INFO ] Deduced a trap composed of 170 places in 1082 ms of which 9 ms to minimize.
[2024-05-31 22:41:43] [INFO ] Deduced a trap composed of 162 places in 960 ms of which 9 ms to minimize.
[2024-05-31 22:41:44] [INFO ] Deduced a trap composed of 161 places in 989 ms of which 10 ms to minimize.
[2024-05-31 22:41:45] [INFO ] Deduced a trap composed of 197 places in 964 ms of which 10 ms to minimize.
[2024-05-31 22:41:46] [INFO ] Deduced a trap composed of 209 places in 1010 ms of which 10 ms to minimize.
[2024-05-31 22:41:47] [INFO ] Deduced a trap composed of 169 places in 1163 ms of which 10 ms to minimize.
[2024-05-31 22:41:48] [INFO ] Deduced a trap composed of 81 places in 1128 ms of which 10 ms to minimize.
[2024-05-31 22:41:49] [INFO ] Deduced a trap composed of 114 places in 1138 ms of which 11 ms to minimize.
[2024-05-31 22:41:51] [INFO ] Deduced a trap composed of 95 places in 1140 ms of which 11 ms to minimize.
[2024-05-31 22:41:52] [INFO ] Deduced a trap composed of 224 places in 1199 ms of which 11 ms to minimize.
[2024-05-31 22:41:53] [INFO ] Deduced a trap composed of 204 places in 1176 ms of which 10 ms to minimize.
[2024-05-31 22:41:54] [INFO ] Deduced a trap composed of 182 places in 1083 ms of which 11 ms to minimize.
[2024-05-31 22:41:55] [INFO ] Deduced a trap composed of 264 places in 1093 ms of which 11 ms to minimize.
[2024-05-31 22:41:56] [INFO ] Deduced a trap composed of 189 places in 1137 ms of which 11 ms to minimize.
[2024-05-31 22:41:58] [INFO ] Deduced a trap composed of 130 places in 1089 ms of which 10 ms to minimize.
SMT process timed out in 47382ms, After SMT, problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1707 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1707/1707 places, 3379/3379 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1707 transition count 3375
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1703 transition count 3375
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 1702 transition count 3371
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 1702 transition count 3371
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 1702 transition count 3369
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 1700 transition count 3369
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 21 place count 1700 transition count 3369
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 28 place count 1693 transition count 3362
Iterating global reduction 3 with 7 rules applied. Total rules applied 35 place count 1693 transition count 3362
Applied a total of 35 rules in 362 ms. Remains 1693 /1707 variables (removed 14) and now considering 3362/3379 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 1693/1707 places, 3362/3379 transitions.
RANDOM walk for 40000 steps (1521 resets) in 707 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (272 resets) in 219 ms. (181 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 66249 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 1
Probabilistic random walk after 66249 steps, saw 29679 distinct states, run finished after 3001 ms. (steps per millisecond=22 ) properties seen :0
[2024-05-31 22:42:01] [INFO ] Flow matrix only has 2980 transitions (discarded 382 similar events)
// Phase 1: matrix 2980 rows 1693 cols
[2024-05-31 22:42:01] [INFO ] Computed 469 invariants in 41 ms
[2024-05-31 22:42:01] [INFO ] State equation strengthened by 1508 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1004/1036 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1036 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 519/1555 variables, 325/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1555 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/1583 variables, 28/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1583 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 110/1693 variables, 110/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1693 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2980/4673 variables, 1693/2162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/4673 variables, 1508/3670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/4673 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/4673 variables, 0/3670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4673/4673 variables, and 3670 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 436/436 constraints, State Equation: 1693/1693 constraints, ReadFeed: 1508/1508 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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1004/1036 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1036 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1036 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 519/1555 variables, 325/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:42:04] [INFO ] Deduced a trap composed of 43 places in 1128 ms of which 10 ms to minimize.
[2024-05-31 22:42:05] [INFO ] Deduced a trap composed of 179 places in 1107 ms of which 11 ms to minimize.
[2024-05-31 22:42:06] [INFO ] Deduced a trap composed of 164 places in 1095 ms of which 10 ms to minimize.
[2024-05-31 22:42:07] [INFO ] Deduced a trap composed of 205 places in 1098 ms of which 11 ms to minimize.
[2024-05-31 22:42:08] [INFO ] Deduced a trap composed of 186 places in 1066 ms of which 11 ms to minimize.
[2024-05-31 22:42:10] [INFO ] Deduced a trap composed of 149 places in 1067 ms of which 9 ms to minimize.
[2024-05-31 22:42:11] [INFO ] Deduced a trap composed of 164 places in 1088 ms of which 10 ms to minimize.
[2024-05-31 22:42:12] [INFO ] Deduced a trap composed of 203 places in 1104 ms of which 10 ms to minimize.
[2024-05-31 22:42:13] [INFO ] Deduced a trap composed of 180 places in 1074 ms of which 12 ms to minimize.
[2024-05-31 22:42:14] [INFO ] Deduced a trap composed of 217 places in 1093 ms of which 10 ms to minimize.
[2024-05-31 22:42:15] [INFO ] Deduced a trap composed of 191 places in 1056 ms of which 10 ms to minimize.
[2024-05-31 22:42:16] [INFO ] Deduced a trap composed of 180 places in 1100 ms of which 11 ms to minimize.
[2024-05-31 22:42:17] [INFO ] Deduced a trap composed of 193 places in 1086 ms of which 10 ms to minimize.
[2024-05-31 22:42:18] [INFO ] Deduced a trap composed of 263 places in 983 ms of which 10 ms to minimize.
[2024-05-31 22:42:19] [INFO ] Deduced a trap composed of 173 places in 1104 ms of which 23 ms to minimize.
[2024-05-31 22:42:21] [INFO ] Deduced a trap composed of 203 places in 1067 ms of which 11 ms to minimize.
[2024-05-31 22:42:22] [INFO ] Deduced a trap composed of 181 places in 1083 ms of which 10 ms to minimize.
[2024-05-31 22:42:23] [INFO ] Deduced a trap composed of 182 places in 969 ms of which 10 ms to minimize.
[2024-05-31 22:42:24] [INFO ] Deduced a trap composed of 142 places in 947 ms of which 10 ms to minimize.
[2024-05-31 22:42:25] [INFO ] Deduced a trap composed of 202 places in 954 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1555 variables, 20/351 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:42:26] [INFO ] Deduced a trap composed of 204 places in 915 ms of which 9 ms to minimize.
[2024-05-31 22:42:27] [INFO ] Deduced a trap composed of 235 places in 913 ms of which 11 ms to minimize.
[2024-05-31 22:42:28] [INFO ] Deduced a trap composed of 203 places in 909 ms of which 10 ms to minimize.
[2024-05-31 22:42:28] [INFO ] Deduced a trap composed of 205 places in 954 ms of which 10 ms to minimize.
[2024-05-31 22:42:29] [INFO ] Deduced a trap composed of 198 places in 944 ms of which 10 ms to minimize.
[2024-05-31 22:42:30] [INFO ] Deduced a trap composed of 203 places in 983 ms of which 11 ms to minimize.
[2024-05-31 22:42:31] [INFO ] Deduced a trap composed of 212 places in 975 ms of which 10 ms to minimize.
[2024-05-31 22:42:32] [INFO ] Deduced a trap composed of 212 places in 907 ms of which 10 ms to minimize.
[2024-05-31 22:42:33] [INFO ] Deduced a trap composed of 223 places in 964 ms of which 10 ms to minimize.
[2024-05-31 22:42:34] [INFO ] Deduced a trap composed of 261 places in 962 ms of which 10 ms to minimize.
[2024-05-31 22:42:35] [INFO ] Deduced a trap composed of 201 places in 941 ms of which 10 ms to minimize.
[2024-05-31 22:42:36] [INFO ] Deduced a trap composed of 220 places in 932 ms of which 10 ms to minimize.
[2024-05-31 22:42:37] [INFO ] Deduced a trap composed of 247 places in 947 ms of which 10 ms to minimize.
[2024-05-31 22:42:38] [INFO ] Deduced a trap composed of 215 places in 918 ms of which 10 ms to minimize.
[2024-05-31 22:42:39] [INFO ] Deduced a trap composed of 229 places in 913 ms of which 10 ms to minimize.
[2024-05-31 22:42:40] [INFO ] Deduced a trap composed of 260 places in 887 ms of which 9 ms to minimize.
[2024-05-31 22:42:41] [INFO ] Deduced a trap composed of 220 places in 877 ms of which 9 ms to minimize.
[2024-05-31 22:42:42] [INFO ] Deduced a trap composed of 225 places in 894 ms of which 9 ms to minimize.
[2024-05-31 22:42:43] [INFO ] Deduced a trap composed of 235 places in 901 ms of which 10 ms to minimize.
[2024-05-31 22:42:44] [INFO ] Deduced a trap composed of 235 places in 899 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1555 variables, 20/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:42:45] [INFO ] Deduced a trap composed of 200 places in 931 ms of which 9 ms to minimize.
[2024-05-31 22:42:46] [INFO ] Deduced a trap composed of 173 places in 927 ms of which 10 ms to minimize.
[2024-05-31 22:42:47] [INFO ] Deduced a trap composed of 189 places in 929 ms of which 10 ms to minimize.
[2024-05-31 22:42:48] [INFO ] Deduced a trap composed of 142 places in 948 ms of which 11 ms to minimize.
[2024-05-31 22:42:49] [INFO ] Deduced a trap composed of 187 places in 935 ms of which 10 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 167 places in 915 ms of which 9 ms to minimize.
[2024-05-31 22:42:50] [INFO ] Deduced a trap composed of 193 places in 898 ms of which 10 ms to minimize.
[2024-05-31 22:42:51] [INFO ] Deduced a trap composed of 177 places in 905 ms of which 10 ms to minimize.
[2024-05-31 22:42:52] [INFO ] Deduced a trap composed of 156 places in 916 ms of which 9 ms to minimize.
[2024-05-31 22:42:53] [INFO ] Deduced a trap composed of 281 places in 948 ms of which 10 ms to minimize.
[2024-05-31 22:42:54] [INFO ] Deduced a trap composed of 241 places in 924 ms of which 11 ms to minimize.
[2024-05-31 22:42:55] [INFO ] Deduced a trap composed of 205 places in 921 ms of which 10 ms to minimize.
[2024-05-31 22:42:56] [INFO ] Deduced a trap composed of 216 places in 924 ms of which 10 ms to minimize.
[2024-05-31 22:42:57] [INFO ] Deduced a trap composed of 198 places in 895 ms of which 10 ms to minimize.
[2024-05-31 22:42:58] [INFO ] Deduced a trap composed of 243 places in 923 ms of which 10 ms to minimize.
[2024-05-31 22:42:59] [INFO ] Deduced a trap composed of 221 places in 949 ms of which 10 ms to minimize.
[2024-05-31 22:43:00] [INFO ] Deduced a trap composed of 219 places in 1078 ms of which 10 ms to minimize.
[2024-05-31 22:43:01] [INFO ] Deduced a trap composed of 214 places in 1053 ms of which 10 ms to minimize.
[2024-05-31 22:43:02] [INFO ] Deduced a trap composed of 269 places in 1096 ms of which 10 ms to minimize.
[2024-05-31 22:43:03] [INFO ] Deduced a trap composed of 222 places in 1088 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1555 variables, 20/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 22:43:04] [INFO ] Deduced a trap composed of 253 places in 973 ms of which 10 ms to minimize.
[2024-05-31 22:43:05] [INFO ] Deduced a trap composed of 231 places in 948 ms of which 10 ms to minimize.
[2024-05-31 22:43:06] [INFO ] Deduced a trap composed of 217 places in 925 ms of which 11 ms to minimize.
[2024-05-31 22:43:07] [INFO ] Deduced a trap composed of 189 places in 1036 ms of which 10 ms to minimize.
[2024-05-31 22:43:09] [INFO ] Deduced a trap composed of 103 places in 1040 ms of which 10 ms to minimize.
[2024-05-31 22:43:10] [INFO ] Deduced a trap composed of 198 places in 1030 ms of which 10 ms to minimize.
[2024-05-31 22:43:11] [INFO ] Deduced a trap composed of 172 places in 1110 ms of which 10 ms to minimize.
[2024-05-31 22:43:12] [INFO ] Deduced a trap composed of 183 places in 1069 ms of which 10 ms to minimize.
[2024-05-31 22:43:13] [INFO ] Deduced a trap composed of 190 places in 1061 ms of which 10 ms to minimize.
[2024-05-31 22:43:14] [INFO ] Deduced a trap composed of 134 places in 1057 ms of which 10 ms to minimize.
[2024-05-31 22:43:15] [INFO ] Deduced a trap composed of 189 places in 1041 ms of which 10 ms to minimize.
[2024-05-31 22:43:16] [INFO ] Deduced a trap composed of 175 places in 1002 ms of which 10 ms to minimize.
[2024-05-31 22:43:17] [INFO ] Deduced a trap composed of 196 places in 1007 ms of which 10 ms to minimize.
[2024-05-31 22:43:18] [INFO ] Deduced a trap composed of 133 places in 1046 ms of which 10 ms to minimize.
SMT process timed out in 77012ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1693/1693 places, 3362/3362 transitions.
Applied a total of 0 rules in 78 ms. Remains 1693 /1693 variables (removed 0) and now considering 3362/3362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 1693/1693 places, 3362/3362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1693/1693 places, 3362/3362 transitions.
Applied a total of 0 rules in 76 ms. Remains 1693 /1693 variables (removed 0) and now considering 3362/3362 (removed 0) transitions.
[2024-05-31 22:43:18] [INFO ] Flow matrix only has 2980 transitions (discarded 382 similar events)
[2024-05-31 22:43:18] [INFO ] Invariant cache hit.
[2024-05-31 22:43:21] [INFO ] Implicit Places using invariants in 2680 ms returned [4, 7, 9, 10, 11, 13, 17, 23, 31, 41, 54, 68, 99, 100, 101, 102, 103, 115, 125, 133, 139, 143, 145, 156, 162, 164, 165, 168, 170, 174, 180, 190, 201, 213, 226, 239, 240, 241, 242, 243, 253, 261, 267, 271, 273, 275, 286, 292, 294, 295, 296, 297, 298, 300, 302, 306, 312, 320, 330, 341, 352, 353, 354, 355, 356, 364, 370, 374, 376, 378, 380, 391, 397, 399, 400, 401, 402, 403, 405, 407, 409, 413, 419, 427, 436, 445, 446, 447, 448, 449, 455, 459, 461, 463, 465, 467, 478, 484, 487, 488, 489, 491, 493, 495, 497, 501, 505, 511, 518, 525, 526, 527, 528, 529, 533, 535, 537, 539, 541, 543, 554, 563, 564, 565, 566, 567, 569, 571, 573, 575, 577, 581, 586, 592, 593, 594, 595, 596, 599, 601, 603, 605, 607, 609, 620, 626, 628, 629, 630, 631, 632, 634, 636, 638, 640, 642, 645, 648, 651, 652, 653, 654, 655, 657, 659, 661, 663, 665, 667, 678, 687, 688, 689, 691, 694, 696, 698, 702, 704, 706, 708, 711, 712, 713, 714, 716, 718, 722, 724, 726, 728, 739, 741, 744, 746, 747, 749, 750, 752, 754, 756, 758, 760, 762, 766, 768, 769, 770, 771, 772, 774, 776, 778, 780, 782, 784, 795, 802, 804, 805, 806, 807, 808, 810, 812, 814, 816, 818, 820, 822, 824, 827, 828, 830, 832, 834, 836, 838, 842, 855, 861, 864, 866, 867, 868, 872, 874, 876, 878, 880, 882, 884, 887, 888, 889, 890, 891, 894, 896, 899, 901, 903, 905, 916, 922, 924, 925, 927, 928, 930, 932, 934, 936, 938, 940, 945, 950, 951, 953, 954, 961, 963, 965, 967, 969, 971, 982, 988, 990, 991, 992, 993, 994, 996, 998, 1000, 1002, 1004, 1008, 1014, 1021, 1022, 1024, 1025, 1032, 1036, 1038, 1041, 1043, 1045, 1056, 1062, 1064, 1065, 1066, 1067, 1068, 1070, 1072, 1074, 1076, 1080, 1086, 1094, 1103, 1104, 1105, 1106, 1107, 1116, 1122, 1126, 1128, 1130, 1132, 1143, 1149, 1153, 1154, 1156, 1159, 1161, 1165, 1169, 1175, 1183, 1193, 1204, 1206, 1207, 1208, 1220, 1228, 1234, 1238, 1240, 1242, 1253, 1259, 1261, 1262, 1263, 1264, 1265, 1267, 1270, 1274, 1280, 1288, 1298, 1310, 1323, 1324, 1325, 1326, 1327, 1340, 1350, 1358, 1364, 1368, 1370, 1381, 1383, 1386, 1388, 1389, 1390, 1391, 1392, 1394, 1398, 1404, 1412, 1422, 1434, 1448, 1463, 1464, 1465, 1466, 1467, 1482, 1494, 1504, 1512, 1518, 1522, 1533]
[2024-05-31 22:43:21] [INFO ] Actually due to overlaps returned [554, 620, 982, 286, 678, 795, 855, 916, 1056, 1143, 1253, 1381, 1533, 156, 391, 478, 739, 4, 9, 10, 11, 99, 100, 101, 102, 164, 165, 239, 240, 241, 242, 294, 295, 296, 297, 352, 353, 354, 355, 399, 400, 401, 402, 445, 446, 447, 448, 487, 488, 489, 525, 526, 527, 528, 563, 564, 565, 566, 592, 593, 594, 595, 628, 629, 630, 631, 651, 652, 653, 654, 687, 688, 689, 711, 712, 713, 741, 746, 747, 749, 768, 769, 770, 771, 804, 805, 806, 807, 824, 827, 864, 866, 867, 887, 888, 889, 890, 924, 925, 927, 950, 951, 953, 990, 991, 992, 993, 1021, 1022, 1024, 1064, 1065, 1066, 1067, 1103, 1104, 1105, 1106, 1153, 1154, 1204, 1206, 1207, 1261, 1262, 1263, 1264, 1323, 1324, 1325, 1326, 1383, 1388, 1389, 1390, 1391, 1463, 1464, 1465, 1466]
Discarding 140 places :
Implicit Place search using SMT only with invariants took 2695 ms to find 140 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1553/1693 places, 3362/3362 transitions.
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 112 place count 1441 transition count 3250
Iterating global reduction 0 with 112 rules applied. Total rules applied 224 place count 1441 transition count 3250
Discarding 112 places :
Symmetric choice reduction at 0 with 112 rule applications. Total rules 336 place count 1329 transition count 3138
Iterating global reduction 0 with 112 rules applied. Total rules applied 448 place count 1329 transition count 3138
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 449 place count 1328 transition count 3134
Iterating global reduction 0 with 1 rules applied. Total rules applied 450 place count 1328 transition count 3134
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 453 place count 1328 transition count 3131
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 456 place count 1325 transition count 3131
Applied a total of 456 rules in 223 ms. Remains 1325 /1553 variables (removed 228) and now considering 3131/3362 (removed 231) transitions.
[2024-05-31 22:43:21] [INFO ] Flow matrix only has 2749 transitions (discarded 382 similar events)
// Phase 1: matrix 2749 rows 1325 cols
[2024-05-31 22:43:21] [INFO ] Computed 329 invariants in 47 ms
[2024-05-31 22:43:23] [INFO ] Implicit Places using invariants in 1837 ms returned [6, 9, 13, 19, 27, 37, 50, 64, 95, 107, 117, 125, 131, 135, 137, 152, 156, 158, 162, 168, 178, 189, 201, 214, 227, 237, 245, 251, 255, 257, 259, 269, 271, 273, 275, 279, 285, 293, 303, 314, 325, 333, 339, 343, 345, 347, 349, 358, 360, 362, 364, 366, 370, 376, 384, 393, 402, 408, 412, 414, 416, 418, 420, 428, 432, 434, 436, 438, 442, 446, 452, 459, 466, 470, 472, 474, 476, 478, 480, 492, 494, 496, 498, 500, 502, 506, 511, 516, 519, 521, 523, 525, 527, 529, 537, 539, 541, 543, 545, 547, 549, 552, 555, 558, 560, 562, 564, 566, 568, 570, 582, 585, 587, 589, 593, 595, 597, 599, 602, 604, 606, 610, 612, 614, 616, 624, 627, 629, 631, 633, 635, 637, 639, 643, 645, 647, 649, 651, 653, 655, 657, 666, 668, 670, 672, 674, 676, 678, 680, 682, 686, 688, 690, 692, 694, 696, 700, 712, 716, 720, 722, 724, 726, 728, 730, 732, 735, 738, 740, 743, 745, 747, 749, 758, 761, 763, 765, 767, 769, 771, 773, 778, 784, 791, 793, 795, 797, 799, 801, 811, 813, 815, 817, 819, 821, 823, 827, 833, 841, 848, 852, 854, 857, 859, 861, 870, 872, 874, 876, 878, 880, 884, 890, 898, 907, 916, 922, 926, 928, 930, 932, 940, 945, 948, 950, 954, 958, 964, 972, 982, 994, 1006, 1014, 1020, 1024, 1026, 1028, 1039, 1041, 1043, 1046, 1050, 1056, 1064, 1074, 1086, 1099, 1112, 1122, 1130, 1136, 1140, 1142, 1148, 1150, 1152, 1156, 1162, 1170, 1180, 1192, 1206, 1221, 1236, 1248, 1258, 1266, 1272, 1276]
Discarding 269 places :
Implicit Place search using SMT only with invariants took 1844 ms to find 269 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1056/1693 places, 3131/3362 transitions.
Applied a total of 0 rules in 67 ms. Remains 1056 /1056 variables (removed 0) and now considering 3131/3131 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4907 ms. Remains : 1056/1693 places, 3131/3362 transitions.
RANDOM walk for 40000 steps (1609 resets) in 641 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (183 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 58635 steps, run visited all 1 properties in 2344 ms. (steps per millisecond=25 )
Probabilistic random walk after 58635 steps, saw 25037 distinct states, run finished after 2347 ms. (steps per millisecond=24 ) properties seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C04-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 156163 ms.
ITS solved all properties within timeout

BK_STOP 1717195406428

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C04"
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 MultiCrashLeafsetExtension-PT-S16C04, 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 r508-tall-171654350700022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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