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.r480-tall-171624189800678.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 DES-PT-10b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K 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 DES-PT-10b-ReachabilityCardinality-2024-00
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-01
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-02
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-03
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-04
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-05
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-06
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-07
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-08
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-09
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-10
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-11
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-12
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-13
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-14
FORMULA_NAME DES-PT-10b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717193334758

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:08:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:08:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:08:56] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-31 22:08:56] [INFO ] Transformed 320 places.
[2024-05-31 22:08:56] [INFO ] Transformed 271 transitions.
[2024-05-31 22:08:56] [INFO ] Found NUPN structural information;
[2024-05-31 22:08:56] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-10b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (337 resets) in 1328 ms. (30 steps per ms) remains 6/12 properties
FORMULA DES-PT-10b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (43 resets) in 492 ms. (81 steps per ms) remains 5/6 properties
FORMULA DES-PT-10b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (42 resets) in 1383 ms. (28 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (50 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (53 resets) in 175 ms. (227 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (46 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
// Phase 1: matrix 271 rows 320 cols
[2024-05-31 22:08:57] [INFO ] Computed 65 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 183/271 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 183/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 48/319 variables, 21/335 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 48/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/319 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 1/320 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 271/591 variables, 320/705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/591 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 705 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1525 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 183/271 variables, 39/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 183/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 4/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 26 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:08:59] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem DES-PT-10b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA DES-PT-10b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 48/319 variables, 21/339 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 48/387 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 1/388 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 2/390 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 1 ms to minimize.
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 4 ms to minimize.
[2024-05-31 22:09:00] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 1 ms to minimize.
[2024-05-31 22:09:01] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/319 variables, 4/394 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:01] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/319 variables, 1/395 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/320 variables, 1/396 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/320 variables, 1/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/320 variables, 0/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 271/591 variables, 320/717 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/591 variables, 4/721 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:02] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/591 variables, 1/722 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:03] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/591 variables, 1/723 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-31 22:09:04] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 724 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5010 ms.
Refiners :[Domain max(s): 320/320 constraints, Positive P Invariants (semi-flows): 39/39 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 320/320 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 15/15 constraints]
After SMT, in 6660ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 271/271 transitions.
Graph (complete) has 621 edges and 320 vertex of which 316 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 316 transition count 261
Reduce places removed 7 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 12 rules applied. Total rules applied 21 place count 309 transition count 256
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 26 place count 304 transition count 256
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 26 place count 304 transition count 250
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 298 transition count 250
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 53 place count 283 transition count 235
Iterating global reduction 3 with 15 rules applied. Total rules applied 68 place count 283 transition count 235
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 78 place count 273 transition count 225
Iterating global reduction 3 with 10 rules applied. Total rules applied 88 place count 273 transition count 225
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 98 place count 273 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 99 place count 272 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 99 place count 272 transition count 214
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 101 place count 271 transition count 214
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 211 place count 216 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 212 place count 216 transition count 158
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 216 place count 214 transition count 168
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 221 place count 214 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 226 place count 209 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 208 transition count 162
Applied a total of 227 rules in 161 ms. Remains 208 /320 variables (removed 112) and now considering 162/271 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 208/320 places, 162/271 transitions.
RANDOM walk for 40000 steps (794 resets) in 991 ms. (40 steps per ms) remains 3/4 properties
FORMULA DES-PT-10b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (140 resets) in 137 ms. (289 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (153 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (149 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
// Phase 1: matrix 162 rows 208 cols
[2024-05-31 22:09:04] [INFO ] Computed 64 invariants in 9 ms
[2024-05-31 22:09:04] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/66 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/146 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 44/190 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 18/208 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 162/370 variables, 208/272 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 18/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/370 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 290 constraints, problems are : Problem set: 0 solved, 3 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 208/208 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 23/34 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 32/66 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 80/146 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 44/190 variables, 22/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 18/208 variables, 15/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/208 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 162/370 variables, 208/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/370 variables, 18/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/370 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 7 places in 95 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 6 places in 414 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:09:06] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 22:09:07] [INFO ] Deduced a trap composed of 16 places in 767 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/370 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/370 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 307 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2595 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 208/208 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
After SMT, in 2869ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1029 ms.
Support contains 11 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 162/162 transitions.
Graph (complete) has 493 edges and 208 vertex of which 204 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 204 transition count 156
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 199 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 63 place count 173 transition count 130
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 170 transition count 127
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 170 transition count 127
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 79 place count 170 transition count 117
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 170 transition count 112
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 91 place count 165 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 165 transition count 110
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 94 place count 163 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 95 place count 162 transition count 108
Applied a total of 95 rules in 90 ms. Remains 162 /208 variables (removed 46) and now considering 108/162 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 162/208 places, 108/162 transitions.
RANDOM walk for 40000 steps (1185 resets) in 324 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (230 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (246 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (233 resets) in 97 ms. (408 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 311074 steps, run visited all 3 properties in 916 ms. (steps per millisecond=339 )
Probabilistic random walk after 311074 steps, saw 47497 distinct states, run finished after 920 ms. (steps per millisecond=338 ) properties seen :3
FORMULA DES-PT-10b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DES-PT-10b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 14046 ms.
ITS solved all properties within timeout

BK_STOP 1717193350275

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-10b"
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 DES-PT-10b, 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 r480-tall-171624189800678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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