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.r532-smll-171683810800127.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 SieveSingleMsgMbox-PT-d2m36, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810800127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 19:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 19:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 12 19:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 19:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-01
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-04
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-05
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-07
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-08
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-10
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14
FORMULA_NAME SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717249342220

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m36
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:42:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:42:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:42:25] [INFO ] Load time of PNML (sax parser for PT used): 665 ms
[2024-06-01 13:42:25] [INFO ] Transformed 2398 places.
[2024-06-01 13:42:25] [INFO ] Transformed 1954 transitions.
[2024-06-01 13:42:25] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 943 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1984 places in 23 ms
Reduce places removed 1984 places and 0 transitions.
RANDOM walk for 40000 steps (8752 resets) in 3245 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (173 resets) in 93 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (169 resets) in 99 ms. (40 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (162 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (165 resets) in 83 ms. (47 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (173 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (170 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 61 ms. (64 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (330 resets) in 81 ms. (48 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (180 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (169 resets) in 68 ms. (58 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (167 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (179 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (176 resets) in 53 ms. (74 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (179 resets) in 43 ms. (90 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (174 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (178 resets) in 139 ms. (28 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 192277 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :3 out of 16
Probabilistic random walk after 192277 steps, saw 87429 distinct states, run finished after 3010 ms. (steps per millisecond=63 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 1954 rows 414 cols
[2024-06-01 13:42:30] [INFO ] Computed 6 invariants in 99 ms
[2024-06-01 13:42:30] [INFO ] State equation strengthened by 1674 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 184/253 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 161/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1954/2368 variables, 414/420 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2368 variables, 1674/2094 constraints. Problems are: Problem set: 4 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2368/2368 variables, and 2094 constraints, problems are : Problem set: 4 solved, 9 unsolved in 5060 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 414/414 constraints, ReadFeed: 1674/1674 constraints, PredecessorRefiner: 13/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 191/245 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 169/414 variables, 3/6 constraints. Problems are: Problem set: 4 solved, 9 unsolved
[2024-06-01 13:42:37] [INFO ] Deduced a trap composed of 209 places in 619 ms of which 77 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 233 places in 600 ms of which 9 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 216 places in 357 ms of which 4 ms to minimize.
[2024-06-01 13:42:38] [INFO ] Deduced a trap composed of 267 places in 382 ms of which 9 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 155 places in 138 ms of which 3 ms to minimize.
[2024-06-01 13:42:39] [INFO ] Deduced a trap composed of 223 places in 469 ms of which 5 ms to minimize.
[2024-06-01 13:42:40] [INFO ] Deduced a trap composed of 197 places in 459 ms of which 4 ms to minimize.
[2024-06-01 13:42:40] [INFO ] Deduced a trap composed of 257 places in 569 ms of which 4 ms to minimize.
Problem SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14 is UNSAT
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 8/14 constraints. Problems are: Problem set: 5 solved, 8 unsolved
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 240 places in 469 ms of which 4 ms to minimize.
[2024-06-01 13:42:41] [INFO ] Deduced a trap composed of 220 places in 383 ms of which 4 ms to minimize.
SMT process timed out in 11442ms, After SMT, problems are : Problem set: 5 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.11 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 911 place count 308 transition count 941
Iterating global reduction 1 with 80 rules applied. Total rules applied 991 place count 308 transition count 941
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1001 place count 308 transition count 931
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1054 place count 255 transition count 878
Iterating global reduction 2 with 53 rules applied. Total rules applied 1107 place count 255 transition count 878
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 1138 place count 255 transition count 847
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1158 place count 235 transition count 824
Iterating global reduction 3 with 20 rules applied. Total rules applied 1178 place count 235 transition count 824
Ensure Unique test removed 141 transitions
Reduce isomorphic transitions removed 141 transitions.
Iterating post reduction 3 with 141 rules applied. Total rules applied 1319 place count 235 transition count 683
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1321 place count 233 transition count 680
Iterating global reduction 4 with 2 rules applied. Total rules applied 1323 place count 233 transition count 680
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1325 place count 231 transition count 678
Iterating global reduction 4 with 2 rules applied. Total rules applied 1327 place count 231 transition count 678
Applied a total of 1327 rules in 331 ms. Remains 231 /414 variables (removed 183) and now considering 678/1954 (removed 1276) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 231/414 places, 678/1954 transitions.
RANDOM walk for 40000 steps (8953 resets) in 807 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1891 resets) in 267 ms. (149 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1881 resets) in 271 ms. (147 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1914 resets) in 220 ms. (181 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1895 resets) in 265 ms. (150 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1883 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (1903 resets) in 318 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (1924 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (1915 resets) in 381 ms. (104 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 321759 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :3 out of 8
Probabilistic random walk after 321759 steps, saw 151635 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :3
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 678 rows 231 cols
[2024-06-01 13:42:46] [INFO ] Computed 4 invariants in 9 ms
[2024-06-01 13:42:46] [INFO ] State equation strengthened by 504 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 102/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/156 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 557/713 variables, 156/160 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/713 variables, 383/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 196/909 variables, 75/618 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/909 variables, 121/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/909 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 909/909 variables, and 739 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 231/231 constraints, ReadFeed: 504/504 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 102/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 16/156 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 13:42:48] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 557/713 variables, 156/161 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/713 variables, 383/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/713 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 196/909 variables, 75/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/909 variables, 121/740 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/909 variables, 5/745 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 13:42:50] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/909 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/909 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/909 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 909/909 variables, and 746 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4970 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 231/231 constraints, ReadFeed: 504/504 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 6673ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 24496 ms.
Support contains 38 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 678/678 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 218 transition count 568
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 218 transition count 568
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 28 place count 218 transition count 566
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 38 place count 208 transition count 556
Iterating global reduction 1 with 10 rules applied. Total rules applied 48 place count 208 transition count 556
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 51 place count 208 transition count 553
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 205 transition count 548
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 205 transition count 548
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 205 transition count 547
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 60 place count 203 transition count 545
Iterating global reduction 3 with 2 rules applied. Total rules applied 62 place count 203 transition count 545
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 202 transition count 544
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 202 transition count 544
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 201 transition count 543
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 201 transition count 543
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 200 transition count 542
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 200 transition count 542
Applied a total of 68 rules in 95 ms. Remains 200 /231 variables (removed 31) and now considering 542/678 (removed 136) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 200/231 places, 542/678 transitions.
RANDOM walk for 40000 steps (8951 resets) in 399 ms. (100 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1922 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1888 resets) in 141 ms. (281 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (1891 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (1919 resets) in 212 ms. (187 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (1871 resets) in 415 ms. (96 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 423700 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 5
Probabilistic random walk after 423700 steps, saw 199258 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
// Phase 1: matrix 542 rows 200 cols
[2024-06-01 13:43:21] [INFO ] Computed 4 invariants in 3 ms
[2024-06-01 13:43:21] [INFO ] State equation strengthened by 386 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 525/665 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 369/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 77/742 variables, 60/573 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 17/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/742 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 742/742 variables, and 590 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1249 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 200/200 constraints, ReadFeed: 386/386 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 91/129 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/140 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 525/665 variables, 140/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 369/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 77/742 variables, 60/573 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 17/590 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 5/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/742 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 742/742 variables, and 595 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3620 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 200/200 constraints, ReadFeed: 386/386 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 4946ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 16470 ms.
Support contains 38 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 542/542 transitions.
Applied a total of 0 rules in 28 ms. Remains 200 /200 variables (removed 0) and now considering 542/542 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 200/200 places, 542/542 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 542/542 transitions.
Applied a total of 0 rules in 30 ms. Remains 200 /200 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2024-06-01 13:43:42] [INFO ] Invariant cache hit.
[2024-06-01 13:43:42] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 13:43:42] [INFO ] Invariant cache hit.
[2024-06-01 13:43:43] [INFO ] State equation strengthened by 386 read => feed constraints.
[2024-06-01 13:43:44] [INFO ] Implicit Places using invariants and state equation in 1858 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2024-06-01 13:43:44] [INFO ] Redundant transitions in 56 ms returned []
Running 541 sub problems to find dead transitions.
[2024-06-01 13:43:44] [INFO ] Invariant cache hit.
[2024-06-01 13:43:44] [INFO ] State equation strengthened by 386 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/742 variables, 200/204 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 386/590 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/742 variables, and 590 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 200/200 constraints, ReadFeed: 386/386 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 541 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/199 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 3 (OVERLAPS) 1/200 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 5 (OVERLAPS) 542/742 variables, 200/204 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 386/590 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 541/1131 constraints. Problems are: Problem set: 0 solved, 541 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/742 variables, and 1131 constraints, problems are : Problem set: 0 solved, 541 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 200/200 constraints, ReadFeed: 386/386 constraints, PredecessorRefiner: 541/541 constraints, Known Traps: 0/0 constraints]
After SMT, in 62103ms problems are : Problem set: 0 solved, 541 unsolved
Search for dead transitions found 0 dead transitions in 62117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64285 ms. Remains : 200/200 places, 542/542 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 200 transition count 536
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 195 transition count 536
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 11 place count 195 transition count 516
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 51 place count 175 transition count 516
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 71 place count 165 transition count 506
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 165 transition count 503
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 162 transition count 503
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 162 transition count 503
Applied a total of 91 rules in 57 ms. Remains 162 /200 variables (removed 38) and now considering 503/542 (removed 39) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 503 rows 162 cols
[2024-06-01 13:44:46] [INFO ] Computed 4 invariants in 5 ms
[2024-06-01 13:44:47] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:44:47] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 13:44:47] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 13:44:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 13:44:47] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-06-01 13:44:48] [INFO ] After 853ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 2 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:44:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
TRAPS : Iteration 1
[2024-06-01 13:44:49] [INFO ] After 2390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 13:44:50] [INFO ] After 3264ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 3539 ms.
[2024-06-01 13:44:50] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-01 13:44:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 200 places, 542 transitions and 2142 arcs took 13 ms.
[2024-06-01 13:44:50] [INFO ] Flatten gal took : 155 ms
Total runtime 146254 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 : SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13
Could not compute solution for formula : SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-15

BK_STOP 1717249491381

--------------------
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 SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/608/inv_0_
rfs formula name SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/608/inv_1_
rfs formula name SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/608/inv_2_
rfs formula name SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/608/inv_3_
rfs formula name SieveSingleMsgMbox-PT-d2m36-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/608/inv_4_
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="SieveSingleMsgMbox-PT-d2m36"
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 SieveSingleMsgMbox-PT-d2m36, 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 r532-smll-171683810800127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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