About the Execution of LTSMin+red for DNAwalker-PT-16redondantChoiceR
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
847.340 | 251072.00 | 285990.00 | 2852.70 | FTTF?F?T?FT?TF?? | 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-171624276100495.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 DNAwalker-PT-16redondantChoiceR, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r484-smll-171624276100495
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 13 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 13 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 19 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 211K 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 DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717327356381
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 11:22:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 11:22:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 11:22:38] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-02 11:22:38] [INFO ] Transformed 43 places.
[2024-06-02 11:22:38] [INFO ] Transformed 490 transitions.
[2024-06-02 11:22:38] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 377 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1543 resets) in 3027 ms. (13 steps per ms) remains 6/16 properties
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (96 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (93 resets) in 676 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 1781 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (105 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (101 resets) in 215 ms. (185 steps per ms) remains 6/6 properties
[2024-06-02 11:22:40] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2024-06-02 11:22:40] [INFO ] Computed 0 invariants in 26 ms
[2024-06-02 11:22:40] [INFO ] State equation strengthened by 161 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 482/518 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 160/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 13/531 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 1/532 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 204 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2347 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 161/161 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
[2024-06-02 11:22:43] [INFO ] Deduced a trap composed of 1 places in 68 ms of which 13 ms to minimize.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 482/518 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 160/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/532 variables, and 205 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5013 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/161 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 7862ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 43 transition count 482
Applied a total of 8 rules in 57 ms. Remains 43 /43 variables (removed 0) and now considering 482/490 (removed 8) transitions.
Running 464 sub problems to find dead transitions.
// Phase 1: matrix 482 rows 43 cols
[2024-06-02 11:22:48] [INFO ] Computed 0 invariants in 8 ms
[2024-06-02 11:22:48] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 14/525 variables, 10/203 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/525 variables, and 203 constraints, problems are : Problem set: 0 solved, 464 unsolved in 20032 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/511 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 160/193 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 464/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/657 constraints. Problems are: Problem set: 0 solved, 464 unsolved
SMT process timed out in 41038ms, After SMT, problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 41059ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41145 ms. Remains : 43/43 places, 482/490 transitions.
RANDOM walk for 40000 steps (1461 resets) in 752 ms. (53 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (99 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (93 resets) in 451 ms. (88 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (98 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (95 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (107 resets) in 160 ms. (248 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 440680 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 6
Probabilistic random walk after 440680 steps, saw 77741 distinct states, run finished after 3007 ms. (steps per millisecond=146 ) properties seen :0
[2024-06-02 11:23:33] [INFO ] Invariant cache hit.
[2024-06-02 11:23:33] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 482/518 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 160/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/525 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/525 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 203 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4037 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 482/518 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 160/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 204 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45009 ms.
Refiners :[State Equation: 43/43 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 49171ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 482/482 transitions.
Applied a total of 0 rules in 18 ms. Remains 43 /43 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 43/43 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 482/482 transitions.
Applied a total of 0 rules in 35 ms. Remains 43 /43 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-06-02 11:24:22] [INFO ] Invariant cache hit.
[2024-06-02 11:24:22] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-02 11:24:22] [INFO ] Invariant cache hit.
[2024-06-02 11:24:22] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-02 11:24:23] [INFO ] Implicit Places using invariants and state equation in 217 ms returned [42]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 280 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 42/43 places, 482/482 transitions.
Applied a total of 0 rules in 17 ms. Remains 42 /42 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 337 ms. Remains : 42/43 places, 482/482 transitions.
RANDOM walk for 40000 steps (1442 resets) in 1276 ms. (31 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (98 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (93 resets) in 526 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (96 resets) in 276 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (94 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (103 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 495548 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 6
Probabilistic random walk after 495548 steps, saw 87279 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
// Phase 1: matrix 482 rows 42 cols
[2024-06-02 11:24:27] [INFO ] Computed 0 invariants in 5 ms
[2024-06-02 11:24:27] [INFO ] State equation strengthened by 160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 482/518 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 160/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 6/524 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/524 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/524 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 202 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2800 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 482/518 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 160/196 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 208 constraints, problems are : Problem set: 0 solved, 6 unsolved in 75008 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 77940ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 482/482 transitions.
Applied a total of 0 rules in 17 ms. Remains 42 /42 variables (removed 0) and now considering 482/482 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 42/42 places, 482/482 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 482/482 transitions.
Applied a total of 0 rules in 9 ms. Remains 42 /42 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-06-02 11:25:44] [INFO ] Invariant cache hit.
[2024-06-02 11:25:45] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 11:25:45] [INFO ] Invariant cache hit.
[2024-06-02 11:25:45] [INFO ] State equation strengthened by 160 read => feed constraints.
[2024-06-02 11:25:45] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-06-02 11:25:45] [INFO ] Redundant transitions in 40 ms returned []
Running 464 sub problems to find dead transitions.
[2024-06-02 11:25:45] [INFO ] Invariant cache hit.
[2024-06-02 11:25:45] [INFO ] State equation strengthened by 160 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/510 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 160/192 constraints. Problems are: Problem set: 0 solved, 464 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (OVERLAPS) 14/524 variables, 10/202 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 524/524 variables, and 202 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30022 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 478/510 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 160/192 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 464/656 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 524/524 variables, and 666 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30023 ms.
Refiners :[State Equation: 42/42 constraints, ReadFeed: 160/160 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints]
After SMT, in 60595ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60601ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60855 ms. Remains : 42/42 places, 482/482 transitions.
[2024-06-02 11:26:46] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-06-02 11:26:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 42 places, 482 transitions and 1416 arcs took 14 ms.
[2024-06-02 11:26:46] [INFO ] Flatten gal took : 129 ms
Total runtime 248625 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-04
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-06
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-08
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-11
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-14
Could not compute solution for formula : DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-15
BK_STOP 1717327607453
--------------------
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
mcc2024
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/564/inv_0_
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/564/inv_1_
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/564/inv_2_
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/564/inv_3_
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/564/inv_4_
rfs formula name DNAwalker-PT-16redondantChoiceR-ReachabilityFireability-2024-15
rfs formula type EF
rfs formula formula --invariant=/tmp/564/inv_5_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
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="DNAwalker-PT-16redondantChoiceR"
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 DNAwalker-PT-16redondantChoiceR, 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-171624276100495"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR 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 ;