About the Execution of LTSMin+red for SieveSingleMsgMbox-PT-d0m64
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 734.859 | 29759.00 | 54499.00 | 287.20 | 0 1 0 1 ? 0 0 1 0 0 0 1 1 1 1 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-171683810600037.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-d0m64, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r532-smll-171683810600037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 19:30 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-d0m64-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1717242382912
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-d0m64
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:46:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 11:46:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:46:25] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-01 11:46:25] [INFO ] Transformed 262 places.
[2024-06-01 11:46:25] [INFO ] Transformed 73 transitions.
[2024-06-01 11:46:25] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 449 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-d0m64-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 73 rows 72 cols
[2024-06-01 11:46:25] [INFO ] Computed 6 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 101, 1, 31, 1, 1, 1]
RANDOM walk for 10000 steps (2234 resets) in 79 ms. (125 steps per ms)
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50001 steps (5062 resets) in 158 ms. (314 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[1, 101, 1, 31, 1]
[2024-06-01 11:46:26] [INFO ] Invariant cache hit.
[2024-06-01 11:46:26] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 11:46:26] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 15 ms returned sat
[2024-06-01 11:46:26] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2024-06-01 11:46:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:46:26] [INFO ] [Real]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:46:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:46:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:26] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 11:46:26] [INFO ] [Nat]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:46:26] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 39 ms to minimize.
[2024-06-01 11:46:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2024-06-01 11:46:26] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 29 ms.
[2024-06-01 11:46:27] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 53 ms.
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:46:27] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 28 ms.
[2024-06-01 11:46:27] [INFO ] Added : 8 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 68 ms.
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Real]Added 31 Read/Feed constraints in 13 ms returned sat
[2024-06-01 11:46:27] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 11:46:27] [INFO ] [Nat]Added 31 Read/Feed constraints in 16 ms returned sat
[2024-06-01 11:46:27] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:46:28] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 2 ms to minimize.
[2024-06-01 11:46:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 183 ms
[2024-06-01 11:46:28] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 14 ms.
[2024-06-01 11:46:28] [INFO ] Added : 14 causal constraints over 4 iterations in 99 ms. Result :sat
Minimization took 44 ms.
[2024-06-01 11:46:28] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned unsat
[2024-06-01 11:46:28] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Real]Added 31 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:46:28] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-06-01 11:46:28] [INFO ] [Nat]Added 31 Read/Feed constraints in 11 ms returned sat
[2024-06-01 11:46:28] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 4 ms to minimize.
[2024-06-01 11:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-06-01 11:46:28] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 13 ms.
[2024-06-01 11:46:28] [INFO ] Added : 6 causal constraints over 2 iterations in 47 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 1, 0] Max Struct:[1, 101, 1, 1, 1]
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[101, 1]
Support contains 2 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 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 60 transition count 62
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 60 transition count 62
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 59 transition count 61
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 59 transition count 61
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 58 transition count 60
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 58 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 58 transition count 59
Applied a total of 26 rules in 84 ms. Remains 58 /72 variables (removed 14) and now considering 59/73 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 58/72 places, 59/73 transitions.
// Phase 1: matrix 59 rows 58 cols
[2024-06-01 11:46:29] [INFO ] Computed 4 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[64, 1]
RANDOM walk for 1000000 steps (223969 resets) in 1121 ms. (891 steps per ms)
BEST_FIRST walk for 2000000 steps (206266 resets) in 921 ms. (2169 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[64, 1]
[2024-06-01 11:46:31] [INFO ] Invariant cache hit.
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-06-01 11:46:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:46:31] [INFO ] [Real]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Added 23 Read/Feed constraints in 5 ms returned sat
[2024-06-01 11:46:31] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 9 ms.
[2024-06-01 11:46:31] [INFO ] Added : 11 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:46:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 11:46:31] [INFO ] [Nat]Added 23 Read/Feed constraints in 6 ms returned sat
[2024-06-01 11:46:31] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 10 ms.
[2024-06-01 11:46:31] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[64, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[64, 1]
Support contains 2 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 7 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:46:31] [INFO ] Invariant cache hit.
[2024-06-01 11:46:31] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-01 11:46:31] [INFO ] Invariant cache hit.
[2024-06-01 11:46:31] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:46:32] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-06-01 11:46:32] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:46:32] [INFO ] Invariant cache hit.
[2024-06-01 11:46:32] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2916 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 5056ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 5070ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5430 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (9072 resets) in 1465 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4088 resets) in 415 ms. (96 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 224 ms. (177 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4217 resets) in 232 ms. (171 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4140 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 2736437 steps, run timeout after 3001 ms. (steps per millisecond=911 ) properties seen :3 out of 4
Probabilistic random walk after 2736437 steps, saw 1396005 distinct states, run finished after 3005 ms. (steps per millisecond=910 ) properties seen :3
[2024-06-01 11:46:40] [INFO ] Invariant cache hit.
[2024-06-01 11:46:40] [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) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/84 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/103 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:46:41] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 117/117 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 16/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 189ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA SieveSingleMsgMbox-PT-d0m64-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[64]
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m64-UpperBounds-04
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:[64]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[64]
[2024-06-01 11:46:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 10000 steps (2240 resets) in 12 ms. (769 steps per ms)
BEST_FIRST walk for 10000 steps (1017 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 11:46:41] [INFO ] Invariant cache hit.
[2024-06-01 11:46:41] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-06-01 11:46:41] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 11:46:41] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:46:41] [INFO ] [Real]Added 23 Read/Feed constraints in 10 ms returned sat
[2024-06-01 11:46:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:46:41] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:46:41] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-06-01 11:46:41] [INFO ] [Nat]Added 23 Read/Feed constraints in 8 ms returned sat
[2024-06-01 11:46:41] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 12 ms.
[2024-06-01 11:46:41] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 11 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 58/58 places, 59/59 transitions.
[2024-06-01 11:46:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[64]
RANDOM walk for 1000000 steps (223558 resets) in 1125 ms. (888 steps per ms)
BEST_FIRST walk for 1000000 steps (103027 resets) in 386 ms. (2583 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[64]
[2024-06-01 11:46:43] [INFO ] Invariant cache hit.
[2024-06-01 11:46:43] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 11:46:43] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:46:43] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-06-01 11:46:43] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:46:43] [INFO ] [Real]Added 23 Read/Feed constraints in 7 ms returned sat
[2024-06-01 11:46:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 11:46:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-06-01 11:46:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 11:46:43] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 11:46:43] [INFO ] [Nat]Added 23 Read/Feed constraints in 9 ms returned sat
[2024-06-01 11:46:43] [INFO ] Computed and/alt/rep : 15/28/15 causal constraints (skipped 43 transitions) in 21 ms.
[2024-06-01 11:46:43] [INFO ] Added : 11 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[64]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[64]
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 6 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 58/58 places, 59/59 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 59/59 transitions.
Applied a total of 0 rules in 5 ms. Remains 58 /58 variables (removed 0) and now considering 59/59 (removed 0) transitions.
[2024-06-01 11:46:43] [INFO ] Invariant cache hit.
[2024-06-01 11:46:43] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 11:46:43] [INFO ] Invariant cache hit.
[2024-06-01 11:46:43] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 11:46:43] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2024-06-01 11:46:43] [INFO ] Redundant transitions in 2 ms returned []
Running 58 sub problems to find dead transitions.
[2024-06-01 11:46:43] [INFO ] Invariant cache hit.
[2024-06-01 11:46:43] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 85 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (OVERLAPS) 1/58 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 59/117 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 23/85 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 58/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/117 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 143 constraints, problems are : Problem set: 0 solved, 58 unsolved in 2544 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 4622ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 4624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4901 ms. Remains : 58/58 places, 59/59 transitions.
RANDOM walk for 40000 steps (8967 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4101 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4154 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2920064 steps, run timeout after 3001 ms. (steps per millisecond=973 ) properties seen :1 out of 2
Probabilistic random walk after 2920064 steps, saw 1485347 distinct states, run finished after 3001 ms. (steps per millisecond=973 ) properties seen :1
[2024-06-01 11:46:51] [INFO ] Invariant cache hit.
[2024-06-01 11:46:51] [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) 27/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 10/38 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 44/84 variables, 40/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 19/103 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:46:51] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/103 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 117/117 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 16/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 201ms 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:[64]
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m64-UpperBounds-04 in 10575 ms.
[2024-06-01 11:46:52] [INFO ] Flatten gal took : 57 ms
[2024-06-01 11:46:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 12 ms.
[2024-06-01 11:46:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 58 places, 59 transitions and 234 arcs took 8 ms.
Total runtime 27239 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-d0m64-UpperBounds-04
BK_STOP 1717242412671
--------------------
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-d0m64-UpperBounds-04
ub formula formula --maxsum=/tmp/626/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-d0m64"
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-d0m64, 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-171683810600037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m64.tgz
mv SieveSingleMsgMbox-PT-d0m64 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 ;