About the Execution of LTSMin+red for DLCround-PT-11b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
625.451 | 18818.00 | 45557.00 | 482.60 | TTTTFTFTTTFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r484-smll-171624275600255.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 DLCround-PT-11b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624275600255
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 12:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 13 12:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 13 12:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 13 12:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:38 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 1.7M 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 DLCround-PT-11b-ReachabilityFireability-2024-00
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-01
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-02
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-03
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-04
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-05
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-06
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-07
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-08
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-09
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-10
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-11
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-12
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-13
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-14
FORMULA_NAME DLCround-PT-11b-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717233636987
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-11b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 09:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 09:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 09:20:41] [INFO ] Load time of PNML (sax parser for PT used): 689 ms
[2024-06-01 09:20:41] [INFO ] Transformed 4375 places.
[2024-06-01 09:20:41] [INFO ] Transformed 6991 transitions.
[2024-06-01 09:20:41] [INFO ] Found NUPN structural information;
[2024-06-01 09:20:41] [INFO ] Parsed PT model containing 4375 places and 6991 transitions and 19673 arcs in 1164 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 3331 ms. (12 steps per ms) remains 7/16 properties
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1831 ms. (21 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 7/7 properties
// Phase 1: matrix 6991 rows 4375 cols
[2024-06-01 09:20:44] [INFO ] Computed 244 invariants in 78 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 226/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/226 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 4129/4355 variables, 242/468 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4355 variables, 4129/4597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4355 variables, 0/4597 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 20/4375 variables, 2/4599 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4375 variables, 20/4619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4375 variables, 0/4619 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 5668ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 226 out of 4375 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4375/4375 places, 6991/6991 transitions.
Graph (trivial) has 3592 edges and 4375 vertex of which 445 / 4375 are part of one of the 51 SCC in 19 ms
Free SCC test removed 394 places
Drop transitions (Empty/Sink Transition effects.) removed 451 transitions
Reduce isomorphic transitions removed 451 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1515 transitions
Trivial Post-agglo rules discarded 1515 transitions
Performed 1515 trivial Post agglomeration. Transition count delta: 1515
Iterating post reduction 0 with 1515 rules applied. Total rules applied 1516 place count 3981 transition count 5025
Reduce places removed 1515 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 1561 rules applied. Total rules applied 3077 place count 2466 transition count 4979
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 with 24 rules applied. Total rules applied 3101 place count 2444 transition count 4977
Reduce places removed 1 places and 0 transitions.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Iterating post reduction 3 with 70 rules applied. Total rules applied 3171 place count 2443 transition count 4908
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 73 rules applied. Total rules applied 3244 place count 2374 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 3245 place count 2373 transition count 4904
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 79 Pre rules applied. Total rules applied 3245 place count 2373 transition count 4825
Deduced a syphon composed of 79 places in 53 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 6 with 158 rules applied. Total rules applied 3403 place count 2294 transition count 4825
Discarding 547 places :
Symmetric choice reduction at 6 with 547 rule applications. Total rules 3950 place count 1747 transition count 4278
Iterating global reduction 6 with 547 rules applied. Total rules applied 4497 place count 1747 transition count 4278
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 6 with 16 rules applied. Total rules applied 4513 place count 1747 transition count 4262
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 7 with 3 rules applied. Total rules applied 4516 place count 1746 transition count 4260
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 4519 place count 1744 transition count 4259
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 207 Pre rules applied. Total rules applied 4519 place count 1744 transition count 4052
Deduced a syphon composed of 207 places in 29 ms
Reduce places removed 207 places and 0 transitions.
Iterating global reduction 9 with 414 rules applied. Total rules applied 4933 place count 1537 transition count 4052
Discarding 33 places :
Symmetric choice reduction at 9 with 33 rule applications. Total rules 4966 place count 1504 transition count 3605
Iterating global reduction 9 with 33 rules applied. Total rules applied 4999 place count 1504 transition count 3605
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 5006 place count 1504 transition count 3598
Performed 362 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 362 places in 2 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 10 with 724 rules applied. Total rules applied 5730 place count 1142 transition count 3233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 5732 place count 1142 transition count 3231
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 5738 place count 1136 transition count 3141
Iterating global reduction 11 with 6 rules applied. Total rules applied 5744 place count 1136 transition count 3141
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: -876
Deduced a syphon composed of 95 places in 2 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 11 with 190 rules applied. Total rules applied 5934 place count 1041 transition count 4017
Drop transitions (Empty/Sink Transition effects.) removed 104 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 110 transitions.
Iterating post reduction 11 with 110 rules applied. Total rules applied 6044 place count 1041 transition count 3907
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 6050 place count 1035 transition count 3724
Iterating global reduction 12 with 6 rules applied. Total rules applied 6056 place count 1035 transition count 3724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 6058 place count 1035 transition count 3722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 6060 place count 1034 transition count 3732
Drop transitions (Redundant composition of simpler transitions.) removed 160 transitions
Redundant transition composition rules discarded 160 transitions
Iterating global reduction 13 with 160 rules applied. Total rules applied 6220 place count 1034 transition count 3572
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 6226 place count 1028 transition count 3463
Iterating global reduction 13 with 6 rules applied. Total rules applied 6232 place count 1028 transition count 3463
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 6236 place count 1028 transition count 3459
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 6242 place count 1025 transition count 3497
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 6243 place count 1025 transition count 3496
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 6245 place count 1025 transition count 3494
Free-agglomeration rule applied 319 times with reduction of 46 identical transitions.
Iterating global reduction 15 with 319 rules applied. Total rules applied 6564 place count 1025 transition count 3129
Reduce places removed 319 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 348 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 351 transitions.
Iterating post reduction 15 with 670 rules applied. Total rules applied 7234 place count 706 transition count 2778
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 7240 place count 700 transition count 2745
Iterating global reduction 16 with 6 rules applied. Total rules applied 7246 place count 700 transition count 2745
Drop transitions (Redundant composition of simpler transitions.) removed 102 transitions
Redundant transition composition rules discarded 102 transitions
Iterating global reduction 16 with 102 rules applied. Total rules applied 7348 place count 700 transition count 2643
Discarding 5 places :
Symmetric choice reduction at 16 with 5 rule applications. Total rules 7353 place count 695 transition count 2623
Iterating global reduction 16 with 5 rules applied. Total rules applied 7358 place count 695 transition count 2623
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 7360 place count 695 transition count 2679
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 16 with 22 rules applied. Total rules applied 7382 place count 693 transition count 2659
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 17 with 16 rules applied. Total rules applied 7398 place count 693 transition count 2643
Partial Free-agglomeration rule applied 19 times.
Drop transitions (Partial Free agglomeration) removed 19 transitions
Iterating global reduction 17 with 19 rules applied. Total rules applied 7417 place count 693 transition count 2643
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 7418 place count 693 transition count 2642
Applied a total of 7418 rules in 2569 ms. Remains 693 /4375 variables (removed 3682) and now considering 2642/6991 (removed 4349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2585 ms. Remains : 693/4375 places, 2642/6991 transitions.
RANDOM walk for 40000 steps (8 resets) in 1281 ms. (31 steps per ms) remains 1/7 properties
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 352 ms. (113 steps per ms) remains 1/1 properties
[2024-06-01 09:20:52] [INFO ] Flow matrix only has 1563 transitions (discarded 1079 similar events)
// Phase 1: matrix 1563 rows 693 cols
[2024-06-01 09:20:52] [INFO ] Computed 234 invariants in 18 ms
[2024-06-01 09:20:52] [INFO ] State equation strengthened by 240 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/161 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/693 variables, 211/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1563/2256 variables, 693/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2256 variables, 240/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2256 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2256 variables, 0/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2256/2256 variables, and 1167 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1168 ms.
Refiners :[Positive P Invariants (semi-flows): 234/234 constraints, State Equation: 693/693 constraints, ReadFeed: 240/240 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/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 134/161 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 532/693 variables, 211/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/693 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1563/2256 variables, 693/927 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2256 variables, 240/1167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2256 variables, 1/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2256 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/2256 variables, 0/1168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2256/2256 variables, and 1168 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1646 ms.
Refiners :[Positive P Invariants (semi-flows): 234/234 constraints, State Equation: 693/693 constraints, ReadFeed: 240/240 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2949ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 123 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=41 )
FORMULA DLCround-PT-11b-ReachabilityFireability-2024-03 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 22 ms.
All properties solved without resorting to model-checking.
Total runtime 15608 ms.
ITS solved all properties within timeout
BK_STOP 1717233655805
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-11b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is DLCround-PT-11b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r484-smll-171624275600255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-11b.tgz
mv DLCround-PT-11b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;