About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m18
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 626.071 | 31184.00 | 56442.00 | 277.20 | 0 0 0 0 0 0 0 1 1 ? 0 1 0 1 0 0 | 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.r532-smll-171683810600021.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-d0m18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 19:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 19:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 12 19:15 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 57K 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m18-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717241832172
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:37:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:37:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:37:15] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-06-01 11:37:15] [INFO ] Transformed 262 places.
[2024-06-01 11:37:15] [INFO ] Transformed 73 transitions.
[2024-06-01 11:37:15] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Deduced a syphon composed of 190 places in 2 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-06-01 11:37:15] [INFO ] Computed 6 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 7, 7, 1]
RANDOM walk for 10000 steps (2275 resets) in 75 ms. (131 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (5101 resets) in 134 ms. (296 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 7]
[2024-06-01 11:37:15] [INFO ] Invariant cache hit.
[2024-06-01 11:37:16] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 11:37:16] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:37:16] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-06-01 11:37:16] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:37:16] [INFO ] [Real]Added 31 Read/Feed constraints in 39 ms returned sat
[2024-06-01 11:37:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 11:37:16] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:37:16] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-01 11:37:16] [INFO ] [Nat]Added 31 Read/Feed constraints in 19 ms returned sat
[2024-06-01 11:37:16] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 39 ms to minimize.
[2024-06-01 11:37:16] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 4 ms to minimize.
[2024-06-01 11:37:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2024-06-01 11:37:16] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 42 ms.
[2024-06-01 11:37:17] [INFO ] Added : 12 causal constraints over 3 iterations in 146 ms. Result :sat
Minimization took 64 ms.
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:37:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Nat]Added 31 Read/Feed constraints in 12 ms returned sat
[2024-06-01 11:37:17] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 22 ms.
[2024-06-01 11:37:17] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 3 ms to minimize.
[2024-06-01 11:37:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-06-01 11:37:17] [INFO ] Added : 12 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 44 ms.
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Real]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:37:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-06-01 11:37:18] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 11:37:18] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2024-06-01 11:37:18] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:37:18] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:37:18] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 11:37:18] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 3 ms to minimize.
[2024-06-01 11:37:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 345 ms
[2024-06-01 11:37:18] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 17 ms.
[2024-06-01 11:37:18] [INFO ] Added : 10 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 47 ms.
[2024-06-01 11:37:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1] Max Struct:[1, 1, 7, 1]
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 7]
Support contains 3 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 69 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 69 transition count 71
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 62 transition count 64
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 62 transition count 64
Applied a total of 17 rules in 57 ms. Remains 62 /72 variables (removed 10) and now considering 64/73 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 62/72 places, 64/73 transitions.
// Phase 1: matrix 64 rows 62 cols
[2024-06-01 11:37:18] [INFO ] Computed 4 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 7]
RANDOM walk for 1000000 steps (223605 resets) in 1070 ms. (933 steps per ms)
BEST_FIRST walk for 3000002 steps (308347 resets) in 1308 ms. (2291 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 7]
[2024-06-01 11:37:21] [INFO ] Invariant cache hit.
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 11:37:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:37:21] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Added 25 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:37:21] [INFO ] Computed and/alt/rep : 17/30/17 causal constraints (skipped 46 transitions) in 11 ms.
[2024-06-01 11:37:21] [INFO ] Added : 12 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:37:21] [INFO ] Computed and/alt/rep : 17/30/17 causal constraints (skipped 46 transitions) in 15 ms.
[2024-06-01 11:37:21] [INFO ] Added : 12 causal constraints over 3 iterations in 52 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Real]Added 25 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:37:21] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:21] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-06-01 11:37:22] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 11:37:22] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:37:22] [INFO ] Computed and/alt/rep : 17/30/17 causal constraints (skipped 46 transitions) in 7 ms.
[2024-06-01 11:37:22] [INFO ] Added : 8 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 7]
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Applied a total of 0 rules in 11 ms. Remains 62 /62 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 62/62 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Applied a total of 0 rules in 10 ms. Remains 62 /62 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2024-06-01 11:37:22] [INFO ] Invariant cache hit.
[2024-06-01 11:37:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-06-01 11:37:22] [INFO ] Invariant cache hit.
[2024-06-01 11:37:22] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:37:22] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
[2024-06-01 11:37:22] [INFO ] Redundant transitions in 2 ms returned []
Running 63 sub problems to find dead transitions.
[2024-06-01 11:37:22] [INFO ] Invariant cache hit.
[2024-06-01 11:37:22] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/126 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 91 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 64/126 variables, 62/66 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 63/154 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 154 constraints, problems are : Problem set: 0 solved, 63 unsolved in 3128 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 5642ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 5658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6082 ms. Remains : 62/62 places, 64/64 transitions.
RANDOM walk for 40000 steps (8935 resets) in 1797 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4141 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3999 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4124 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (4162 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (4196 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4141 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2283814 steps, run timeout after 3001 ms. (steps per millisecond=761 ) properties seen :5 out of 6
Probabilistic random walk after 2283814 steps, saw 963937 distinct states, run finished after 3007 ms. (steps per millisecond=759 ) properties seen :5
[2024-06-01 11:37:32] [INFO ] Invariant cache hit.
[2024-06-01 11:37:32] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/48 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/76 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/86 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 7/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:37:32] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/89 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/89 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/89 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX2 is UNSAT
After SMT solving in domain Real declared 126/126 variables, and 70 constraints, problems are : Problem set: 1 solved, 0 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 3/25 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 132ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA SieveSingleMsgMbox-PT-d0m18-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[0] Max Struct:[7]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:37:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2249 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (1011 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:37:32] [INFO ] Invariant cache hit.
[2024-06-01 11:37:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:37:32] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 11:37:32] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-06-01 11:37:32] [INFO ] [Real]Added 25 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:37:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:37:32] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 11:37:32] [INFO ] [Nat]Added 25 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:37:32] [INFO ] Computed and/alt/rep : 17/30/17 causal constraints (skipped 46 transitions) in 12 ms.
[2024-06-01 11:37:32] [INFO ] Added : 8 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 60 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 59 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 59 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 59 transition count 60
Applied a total of 7 rules in 36 ms. Remains 59 /62 variables (removed 3) and now considering 60/64 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 59/62 places, 60/64 transitions.
// Phase 1: matrix 60 rows 59 cols
[2024-06-01 11:37:32] [INFO ] Computed 4 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (223694 resets) in 758 ms. (1317 steps per ms)
BEST_FIRST walk for 1000001 steps (102859 resets) in 354 ms. (2816 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-06-01 11:37:33] [INFO ] Invariant cache hit.
[2024-06-01 11:37:33] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2024-06-01 11:37:34] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 11:37:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:37:34] [INFO ] [Real]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:37:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:37:34] [INFO ] [Nat]Absence check using 4 positive place invariants in 3 ms returned sat
[2024-06-01 11:37:34] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 11:37:34] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:37:34] [INFO ] Computed and/alt/rep : 16/28/16 causal constraints (skipped 43 transitions) in 15 ms.
[2024-06-01 11:37:34] [INFO ] Added : 7 causal constraints over 2 iterations in 48 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-06-01 11:37:34] [INFO ] Invariant cache hit.
[2024-06-01 11:37:34] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-06-01 11:37:34] [INFO ] Invariant cache hit.
[2024-06-01 11:37:34] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:37:34] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2024-06-01 11:37:34] [INFO ] Redundant transitions in 1 ms returned []
Running 59 sub problems to find dead transitions.
[2024-06-01 11:37:34] [INFO ] Invariant cache hit.
[2024-06-01 11:37:34] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 86 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1762 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (OVERLAPS) 60/119 variables, 59/63 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 23/86 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 59/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 145 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2753 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 4632ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 4635ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5009 ms. Remains : 59/59 places, 60/60 transitions.
RANDOM walk for 40000 steps (8889 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (4161 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2604930 steps, run timeout after 3001 ms. (steps per millisecond=868 ) properties seen :1 out of 2
Probabilistic random walk after 2604930 steps, saw 1101598 distinct states, run finished after 3001 ms. (steps per millisecond=868 ) properties seen :1
[2024-06-01 11:37:42] [INFO ] Invariant cache hit.
[2024-06-01 11:37:42] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/46 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 26/72 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 12/84 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/84 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:37:42] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/84 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/84 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 119/119 variables, and 67 constraints, problems are : Problem set: 1 solved, 0 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 59/59 constraints, ReadFeed: 3/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 154ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m18-UpperBounds-09 in 10078 ms.
[2024-06-01 11:37:42] [INFO ] Flatten gal took : 68 ms
[2024-06-01 11:37:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-06-01 11:37:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 64 transitions and 254 arcs took 15 ms.
Total runtime 28132 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
BK_STOP 1717241863356
--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name SieveSingleMsgMbox-PT-d0m18-UpperBounds-09
ub formula formula --maxsum=/tmp/641/ub_0_
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-d0m18"
export BK_EXAMINATION="UpperBounds"
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-d0m18, examination is UpperBounds"
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-171683810600021"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m18.tgz
mv SieveSingleMsgMbox-PT-d0m18 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;