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

About the Execution of LTSMin+red for DES-PT-50a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
637.403 246789.00 392404.00 464.60 ???????T???TTT?? 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.r480-tall-171624189900735.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-50a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900735
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K 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.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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-50a-ReachabilityFireability-2024-00
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-01
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-02
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-03
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-04
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-05
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-06
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-07
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-08
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-09
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-10
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-11
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-12
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-13
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-14
FORMULA_NAME DES-PT-50a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717197400797

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:16:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:16:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:16:42] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2024-05-31 23:16:42] [INFO ] Transformed 314 places.
[2024-05-31 23:16:42] [INFO ] Transformed 271 transitions.
[2024-05-31 23:16:42] [INFO ] Found NUPN structural information;
[2024-05-31 23:16:42] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
RANDOM walk for 40000 steps (875 resets) in 2261 ms. (17 steps per ms) remains 13/16 properties
FORMULA DES-PT-50a-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (252 resets) in 436 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (181 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (206 resets) in 976 ms. (40 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (202 resets) in 187 ms. (212 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (171 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (224 resets) in 199 ms. (200 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (201 resets) in 175 ms. (227 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (241 resets) in 99 ms. (400 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (187 resets) in 102 ms. (388 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (204 resets) in 72 ms. (547 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (254 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (190 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (176 resets) in 151 ms. (263 steps per ms) remains 13/13 properties
// Phase 1: matrix 257 rows 314 cols
[2024-05-31 23:16:44] [INFO ] Computed 59 invariants in 21 ms
[2024-05-31 23:16:44] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 157/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 26/183 variables, 31/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 26/214 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 5/188 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 93/281 variables, 19/247 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 93/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/281 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 257/538 variables, 281/621 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/538 variables, 1/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/538 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 13 unsolved
SMT process timed out in 5339ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 157 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 313 transition count 256
Applied a total of 3 rules in 72 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 313/314 places, 256/257 transitions.
RANDOM walk for 40000 steps (876 resets) in 676 ms. (59 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (253 resets) in 234 ms. (170 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (165 resets) in 174 ms. (228 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (203 resets) in 253 ms. (157 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (202 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (193 resets) in 133 ms. (298 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (223 resets) in 183 ms. (217 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (201 resets) in 92 ms. (430 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (244 resets) in 129 ms. (307 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (173 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (205 resets) in 78 ms. (506 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (250 resets) in 176 ms. (226 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (188 resets) in 104 ms. (380 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (185 resets) in 188 ms. (211 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 785104 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :0 out of 13
Probabilistic random walk after 785104 steps, saw 118296 distinct states, run finished after 3006 ms. (steps per millisecond=261 ) properties seen :0
// Phase 1: matrix 256 rows 313 cols
[2024-05-31 23:16:53] [INFO ] Computed 59 invariants in 7 ms
[2024-05-31 23:16:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/182 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/187 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 93/280 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 256/536 variables, 280/339 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 33/569 variables, 33/373 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 0/569 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 373 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 25/182 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 5/187 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 93/280 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem DES-PT-50a-ReachabilityFireability-2024-11 is UNSAT
FORMULA DES-PT-50a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 256/536 variables, 280/339 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/536 variables, 1/340 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/536 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/536 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 33/569 variables, 33/374 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/569 variables, 11/385 constraints. Problems are: Problem set: 1 solved, 12 unsolved
[2024-05-31 23:17:05] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 16 ms to minimize.
[2024-05-31 23:17:05] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:17:06] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:17:07] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/569 variables, 4/389 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/569 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/569 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 389 constraints, problems are : Problem set: 1 solved, 12 unsolved in 27275 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 313/313 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/13 constraints, Known Traps: 4/4 constraints]
After SMT, in 30417ms problems are : Problem set: 1 solved, 12 unsolved
Parikh walk visited 0 properties in 31019 ms.
Support contains 141 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 256/256 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 313 transition count 255
Applied a total of 1 rules in 28 ms. Remains 313 /313 variables (removed 0) and now considering 255/256 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 313/313 places, 255/256 transitions.
RANDOM walk for 40000 steps (749 resets) in 372 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (243 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (137 resets) in 74 ms. (533 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (148 resets) in 169 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (143 resets) in 106 ms. (373 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (124 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (215 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (143 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (188 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (127 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (153 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (123 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (142 resets) in 143 ms. (277 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 892567 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :0 out of 12
Probabilistic random walk after 892567 steps, saw 125957 distinct states, run finished after 3001 ms. (steps per millisecond=297 ) properties seen :0
// Phase 1: matrix 255 rows 313 cols
[2024-05-31 23:17:58] [INFO ] Computed 60 invariants in 6 ms
[2024-05-31 23:17:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 28/169 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5/174 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 105/279 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 255/534 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 34/568 variables, 34/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/568 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/568 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/568 variables, and 374 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 313/313 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 28/169 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 5/174 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/174 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 105/279 variables, 22/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/279 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 255/534 variables, 279/339 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/534 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/534 variables, 1/341 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 23:18:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-31 23:18:06] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/534 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/534 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 34/568 variables, 34/377 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 11/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/568 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/568 variables, and 388 constraints, problems are : Problem set: 0 solved, 12 unsolved in 24605 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 313/313 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 27361ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 33380 ms.
Support contains 141 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 313/313 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 255/255 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 23:18:59] [INFO ] Invariant cache hit.
[2024-05-31 23:18:59] [INFO ] Implicit Places using invariants in 168 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 177 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 312/313 places, 255/255 transitions.
Applied a total of 0 rules in 18 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 206 ms. Remains : 312/313 places, 255/255 transitions.
RANDOM walk for 40000 steps (733 resets) in 358 ms. (111 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (243 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (135 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (148 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (139 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (128 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (215 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (147 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (196 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (122 resets) in 71 ms. (555 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (145 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (116 resets) in 75 ms. (526 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (138 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 739424 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :0 out of 12
Probabilistic random walk after 739424 steps, saw 108424 distinct states, run finished after 3001 ms. (steps per millisecond=246 ) properties seen :0
// Phase 1: matrix 255 rows 312 cols
[2024-05-31 23:19:03] [INFO ] Computed 59 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 28/169 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/173 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 105/278 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 255/533 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 34/567 variables, 34/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/567 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 371 constraints, problems are : Problem set: 0 solved, 12 unsolved in 2709 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 28/169 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 4/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/169 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/173 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 105/278 variables, 22/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 255/533 variables, 278/337 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/533 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/533 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 34/567 variables, 34/372 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 11/383 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 23:19:15] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-31 23:19:15] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 2/385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/567 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/567 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 567/567 variables, and 385 constraints, problems are : Problem set: 0 solved, 12 unsolved in 26406 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 29196ms problems are : Problem set: 0 solved, 12 unsolved
Parikh walk visited 0 properties in 30259 ms.
Support contains 141 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 312/312 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 312 /312 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 23:20:02] [INFO ] Invariant cache hit.
[2024-05-31 23:20:02] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-31 23:20:02] [INFO ] Invariant cache hit.
[2024-05-31 23:20:03] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-31 23:20:03] [INFO ] Redundant transitions in 11 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-31 23:20:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 255/567 variables, 312/371 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-31 23:20:07] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-31 23:20:08] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:20:08] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-31 23:20:08] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-31 23:20:08] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:20:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/567 variables, 6/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/567 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 567/567 variables, and 377 constraints, problems are : Problem set: 0 solved, 254 unsolved in 13588 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/311 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (OVERLAPS) 1/312 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 6/65 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 255/567 variables, 312/377 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 254/631 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 567/567 variables, and 631 constraints, problems are : Problem set: 0 solved, 254 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 312/312 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 6/6 constraints]
After SMT, in 43791ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 43794ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44198 ms. Remains : 312/312 places, 255/255 transitions.
[2024-05-31 23:20:46] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-31 23:20:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 255 transitions and 1236 arcs took 6 ms.
[2024-05-31 23:20:47] [INFO ] Flatten gal took : 76 ms
Total runtime 245055 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-00
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-01
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-02
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-03
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-04
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-05
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-06
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-08
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-09
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-10
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-14
Could not compute solution for formula : DES-PT-50a-ReachabilityFireability-2024-15

BK_STOP 1717197647586

--------------------
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 DES-PT-50a-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_0_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_1_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_2_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_3_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_4_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_5_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_6_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_7_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_8_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_9_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/602/inv_10_
rfs formula name DES-PT-50a-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_11_
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="DES-PT-50a"
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 DES-PT-50a, 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 r480-tall-171624189900735"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;