About the Execution of ITS-Tools for SieveSingleMsgMbox-PT-d1m06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 424.831 | 27054.00 | 44342.00 | 93.40 | 1 1 0 0 0 0 0 0 1 0 1 1 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975200413.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975200413
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 6.6K Feb 26 10:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 10:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 10:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 450K Mar 5 18:23 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-d1m06-UpperBounds-00
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-02
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-03
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-04
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-05
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-06
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-07
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-09
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-12
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-13
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-14
FORMULA_NAME SieveSingleMsgMbox-PT-d1m06-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679178612337
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d1m06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-18 22:30:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 22:30:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:30:14] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2023-03-18 22:30:14] [INFO ] Transformed 1295 places.
[2023-03-18 22:30:14] [INFO ] Transformed 749 transitions.
[2023-03-18 22:30:14] [INFO ] Parsed PT model containing 1295 places and 749 transitions and 2996 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Deduced a syphon composed of 1036 places in 7 ms
Reduce places removed 1036 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 749 rows 259 cols
[2023-03-18 22:30:14] [INFO ] Computed 6 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 2196 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 5) seen :1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 970 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 949 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
[2023-03-18 22:30:15] [INFO ] Invariant cache hit.
[2023-03-18 22:30:15] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 22:30:15] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 15 ms returned sat
[2023-03-18 22:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:15] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-18 22:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-18 22:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:15] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-18 22:30:15] [INFO ] State equation strengthened by 587 read => feed constraints.
[2023-03-18 22:30:16] [INFO ] [Nat]Added 587 Read/Feed constraints in 166 ms returned sat
[2023-03-18 22:30:16] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 4 ms to minimize.
[2023-03-18 22:30:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 279 ms
[2023-03-18 22:30:16] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 129 ms.
[2023-03-18 22:30:16] [INFO ] Added : 20 causal constraints over 4 iterations in 509 ms. Result :sat
Minimization took 137 ms.
[2023-03-18 22:30:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:17] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2023-03-18 22:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:17] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2023-03-18 22:30:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-18 22:30:17] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 47 ms returned sat
[2023-03-18 22:30:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:17] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-18 22:30:17] [INFO ] [Nat]Added 587 Read/Feed constraints in 103 ms returned sat
[2023-03-18 22:30:17] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-03-18 22:30:17] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 0 ms to minimize.
[2023-03-18 22:30:17] [INFO ] Deduced a trap composed of 67 places in 36 ms of which 1 ms to minimize.
[2023-03-18 22:30:18] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2023-03-18 22:30:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 426 ms
[2023-03-18 22:30:18] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 81 ms.
[2023-03-18 22:30:18] [INFO ] Added : 18 causal constraints over 4 iterations in 429 ms. Result :sat
Minimization took 139 ms.
[2023-03-18 22:30:18] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:18] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2023-03-18 22:30:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:19] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2023-03-18 22:30:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:19] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:30:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:19] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-18 22:30:19] [INFO ] [Nat]Added 587 Read/Feed constraints in 152 ms returned sat
[2023-03-18 22:30:19] [INFO ] Computed and/alt/rep : 82/233/82 causal constraints (skipped 666 transitions) in 80 ms.
[2023-03-18 22:30:19] [INFO ] Deduced a trap composed of 31 places in 159 ms of which 1 ms to minimize.
[2023-03-18 22:30:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2023-03-18 22:30:20] [INFO ] Added : 23 causal constraints over 5 iterations in 571 ms. Result :sat
Minimization took 199 ms.
[2023-03-18 22:30:20] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:30:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:20] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-18 22:30:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-18 22:30:20] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-18 22:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:20] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-18 22:30:20] [INFO ] [Nat]Added 587 Read/Feed constraints in 137 ms returned sat
[2023-03-18 22:30:20] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 1 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 123 places in 152 ms of which 1 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 1 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 1 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 27 places in 151 ms of which 0 ms to minimize.
[2023-03-18 22:30:21] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 0 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 73 places in 136 ms of which 1 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 30 places in 149 ms of which 1 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 1 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 0 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 0 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 0 ms to minimize.
[2023-03-18 22:30:22] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2023-03-18 22:30:23] [INFO ] Deduced a trap composed of 26 places in 144 ms of which 0 ms to minimize.
[2023-03-18 22:30:23] [INFO ] Deduced a trap composed of 32 places in 154 ms of which 1 ms to minimize.
[2023-03-18 22:30:24] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 1 ms to minimize.
[2023-03-18 22:30:24] [INFO ] Deduced a trap composed of 128 places in 131 ms of which 6 ms to minimize.
[2023-03-18 22:30:25] [INFO ] Deduced a trap composed of 146 places in 137 ms of which 1 ms to minimize.
[2023-03-18 22:30:25] [INFO ] Trap strengthening (SAT) tested/added 19/19 trap constraints in 4682 ms
Current structural bounds on expressions (after SMT) : [1, 10, 29, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 749/749 transitions.
Graph (complete) has 1159 edges and 259 vertex of which 242 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.3 ms
Discarding 17 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 224 transitions
Reduce isomorphic transitions removed 226 transitions.
Iterating post reduction 0 with 226 rules applied. Total rules applied 227 place count 242 transition count 523
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 288 place count 181 transition count 231
Iterating global reduction 1 with 61 rules applied. Total rules applied 349 place count 181 transition count 231
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 355 place count 181 transition count 225
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 397 place count 139 transition count 183
Iterating global reduction 2 with 42 rules applied. Total rules applied 439 place count 139 transition count 183
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 454 place count 139 transition count 168
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 478 place count 115 transition count 142
Iterating global reduction 3 with 24 rules applied. Total rules applied 502 place count 115 transition count 142
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 516 place count 115 transition count 128
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 522 place count 109 transition count 119
Iterating global reduction 4 with 6 rules applied. Total rules applied 528 place count 109 transition count 119
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 534 place count 103 transition count 113
Iterating global reduction 4 with 6 rules applied. Total rules applied 540 place count 103 transition count 113
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 543 place count 100 transition count 110
Iterating global reduction 4 with 3 rules applied. Total rules applied 546 place count 100 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 100 transition count 109
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 549 place count 98 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 551 place count 98 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 552 place count 97 transition count 106
Iterating global reduction 5 with 1 rules applied. Total rules applied 553 place count 97 transition count 106
Applied a total of 553 rules in 147 ms. Remains 97 /259 variables (removed 162) and now considering 106/749 (removed 643) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 97/259 places, 106/749 transitions.
// Phase 1: matrix 106 rows 97 cols
[2023-03-18 22:30:25] [INFO ] Computed 4 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 224112 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103603 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103400 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103869 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103360 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 4) seen :0
[2023-03-18 22:30:29] [INFO ] Invariant cache hit.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-18 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-18 22:30:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:29] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:30:29] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2023-03-18 22:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2023-03-18 22:30:29] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-18 22:30:29] [INFO ] Added : 19 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 23 ms.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-18 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2023-03-18 22:30:29] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2023-03-18 22:30:29] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2023-03-18 22:30:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2023-03-18 22:30:29] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-18 22:30:29] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2023-03-18 22:30:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-18 22:30:29] [INFO ] Added : 16 causal constraints over 4 iterations in 109 ms. Result :sat
Minimization took 29 ms.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-18 22:30:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:29] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:30:29] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-18 22:30:29] [INFO ] Added : 12 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 20 ms.
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:29] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:30] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-18 22:30:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2023-03-18 22:30:30] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-18 22:30:30] [INFO ] Added : 6 causal constraints over 2 iterations in 29 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 29, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 97/97 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Applied a total of 0 rules in 10 ms. Remains 97 /97 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2023-03-18 22:30:30] [INFO ] Invariant cache hit.
[2023-03-18 22:30:30] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-18 22:30:30] [INFO ] Invariant cache hit.
[2023-03-18 22:30:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:30] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-18 22:30:30] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:30:30] [INFO ] Invariant cache hit.
[2023-03-18 22:30:30] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 97/97 places, 106/106 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-01
[2023-03-18 22:30:30] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2238 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1041 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-18 22:30:30] [INFO ] Invariant cache hit.
[2023-03-18 22:30:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-18 22:30:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:30] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-18 22:30:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:30:30] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2023-03-18 22:30:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-18 22:30:30] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 5 ms.
[2023-03-18 22:30:31] [INFO ] Added : 19 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [17] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 92 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 92 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 92 transition count 99
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 14 place count 90 transition count 97
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 90 transition count 97
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 18 place count 88 transition count 95
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 88 transition count 95
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 22 place count 86 transition count 92
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 86 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 86 transition count 91
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 27 place count 84 transition count 89
Iterating global reduction 4 with 2 rules applied. Total rules applied 29 place count 84 transition count 89
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 83 transition count 88
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 83 transition count 88
Applied a total of 31 rules in 29 ms. Remains 83 /97 variables (removed 14) and now considering 88/106 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 83/97 places, 88/106 transitions.
// Phase 1: matrix 88 rows 83 cols
[2023-03-18 22:30:31] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224372 resets, run finished after 686 ms. (steps per millisecond=1457 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103635 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :0
[2023-03-18 22:30:32] [INFO ] Invariant cache hit.
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-18 22:30:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:30:32] [INFO ] [Nat]Added 33 Read/Feed constraints in 8 ms returned sat
[2023-03-18 22:30:32] [INFO ] Computed and/alt/rep : 23/51/23 causal constraints (skipped 64 transitions) in 4 ms.
[2023-03-18 22:30:32] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 83/83 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-18 22:30:32] [INFO ] Invariant cache hit.
[2023-03-18 22:30:32] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 22:30:32] [INFO ] Invariant cache hit.
[2023-03-18 22:30:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:30:32] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-18 22:30:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 22:30:32] [INFO ] Invariant cache hit.
[2023-03-18 22:30:32] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 83/83 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 in 1980 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-08
// Phase 1: matrix 106 rows 97 cols
[2023-03-18 22:30:32] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1022 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-18 22:30:32] [INFO ] Invariant cache hit.
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:30:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-18 22:30:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2023-03-18 22:30:32] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2023-03-18 22:30:32] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2023-03-18 22:30:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 79 ms
[2023-03-18 22:30:33] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 5 ms.
[2023-03-18 22:30:33] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2023-03-18 22:30:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-18 22:30:33] [INFO ] Added : 16 causal constraints over 4 iterations in 73 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 94 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 94 transition count 103
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 94 transition count 102
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 91 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 91 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 91 transition count 97
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 18 place count 88 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 21 place count 88 transition count 94
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 85 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 85 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 82 transition count 86
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 82 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 82 transition count 85
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 37 place count 79 transition count 82
Iterating global reduction 3 with 3 rules applied. Total rules applied 40 place count 79 transition count 82
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 42 place count 77 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 44 place count 77 transition count 80
Applied a total of 44 rules in 12 ms. Remains 77 /97 variables (removed 20) and now considering 80/106 (removed 26) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 77/97 places, 80/106 transitions.
// Phase 1: matrix 80 rows 77 cols
[2023-03-18 22:30:33] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224046 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 103290 resets, run finished after 313 ms. (steps per millisecond=3194 ) properties (out of 1) seen :0
[2023-03-18 22:30:34] [INFO ] Invariant cache hit.
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-18 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-18 22:30:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-18 22:30:34] [INFO ] [Nat]Added 31 Read/Feed constraints in 6 ms returned sat
[2023-03-18 22:30:34] [INFO ] Computed and/alt/rep : 20/44/20 causal constraints (skipped 59 transitions) in 7 ms.
[2023-03-18 22:30:34] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-18 22:30:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-18 22:30:34] [INFO ] Added : 17 causal constraints over 5 iterations in 100 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 77/77 places, 80/80 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 77 /77 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-18 22:30:34] [INFO ] Invariant cache hit.
[2023-03-18 22:30:34] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-18 22:30:34] [INFO ] Invariant cache hit.
[2023-03-18 22:30:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-18 22:30:34] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-18 22:30:34] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:30:34] [INFO ] Invariant cache hit.
[2023-03-18 22:30:34] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 77/77 places, 80/80 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 in 1857 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-10
// Phase 1: matrix 106 rows 97 cols
[2023-03-18 22:30:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2201 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1055 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-18 22:30:34] [INFO ] Invariant cache hit.
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:34] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:34] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-18 22:30:34] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:34] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2023-03-18 22:30:34] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 7 ms.
[2023-03-18 22:30:34] [INFO ] Added : 12 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 92 transition count 101
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 92 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 92 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 90 transition count 98
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 90 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 88 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 88 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 86 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 86 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 84 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 84 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 82 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 82 transition count 88
Applied a total of 31 rules in 21 ms. Remains 82 /97 variables (removed 15) and now considering 88/106 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 82/97 places, 88/106 transitions.
// Phase 1: matrix 88 rows 82 cols
[2023-03-18 22:30:34] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 224417 resets, run finished after 817 ms. (steps per millisecond=1223 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103787 resets, run finished after 436 ms. (steps per millisecond=2293 ) properties (out of 1) seen :0
[2023-03-18 22:30:36] [INFO ] Invariant cache hit.
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-18 22:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-18 22:30:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:30:36] [INFO ] [Nat]Added 34 Read/Feed constraints in 8 ms returned sat
[2023-03-18 22:30:36] [INFO ] Computed and/alt/rep : 22/52/22 causal constraints (skipped 65 transitions) in 5 ms.
[2023-03-18 22:30:36] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2023-03-18 22:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-18 22:30:36] [INFO ] Added : 16 causal constraints over 4 iterations in 134 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 88/88 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 88/88 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2023-03-18 22:30:36] [INFO ] Invariant cache hit.
[2023-03-18 22:30:36] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-18 22:30:36] [INFO ] Invariant cache hit.
[2023-03-18 22:30:36] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-18 22:30:36] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-18 22:30:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-18 22:30:36] [INFO ] Invariant cache hit.
[2023-03-18 22:30:36] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 357 ms. Remains : 82/82 places, 88/88 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 in 2258 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-11
// Phase 1: matrix 106 rows 97 cols
[2023-03-18 22:30:36] [INFO ] Computed 4 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1004 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-18 22:30:36] [INFO ] Invariant cache hit.
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:36] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-18 22:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-18 22:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:36] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-18 22:30:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-18 22:30:36] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2023-03-18 22:30:36] [INFO ] Computed and/alt/rep : 27/65/27 causal constraints (skipped 78 transitions) in 6 ms.
[2023-03-18 22:30:37] [INFO ] Added : 6 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 106/106 transitions.
Graph (complete) has 269 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 96 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 94 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 94 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 7 place count 94 transition count 102
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 9 place count 92 transition count 100
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 92 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 92 transition count 98
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 15 place count 90 transition count 96
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 90 transition count 96
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 19 place count 88 transition count 94
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 88 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 86 transition count 91
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 86 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 86 transition count 90
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 84 transition count 88
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 84 transition count 88
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 83 transition count 87
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 83 transition count 87
Applied a total of 32 rules in 17 ms. Remains 83 /97 variables (removed 14) and now considering 87/106 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 83/97 places, 87/106 transitions.
// Phase 1: matrix 87 rows 83 cols
[2023-03-18 22:30:37] [INFO ] Computed 4 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 224813 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 103642 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 1) seen :0
[2023-03-18 22:30:38] [INFO ] Invariant cache hit.
[2023-03-18 22:30:38] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:38] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 22:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-18 22:30:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 22:30:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-18 22:30:38] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 22:30:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 22:30:38] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-18 22:30:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:30:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 6 ms returned sat
[2023-03-18 22:30:38] [INFO ] Computed and/alt/rep : 22/49/22 causal constraints (skipped 64 transitions) in 5 ms.
[2023-03-18 22:30:38] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 83/83 places, 87/87 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 87/87 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 87/87 (removed 0) transitions.
[2023-03-18 22:30:38] [INFO ] Invariant cache hit.
[2023-03-18 22:30:38] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-18 22:30:38] [INFO ] Invariant cache hit.
[2023-03-18 22:30:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-18 22:30:38] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-18 22:30:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-18 22:30:38] [INFO ] Invariant cache hit.
[2023-03-18 22:30:38] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 83/83 places, 87/87 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 in 1792 ms.
[2023-03-18 22:30:38] [INFO ] Flatten gal took : 31 ms
[2023-03-18 22:30:38] [INFO ] Applying decomposition
[2023-03-18 22:30:38] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12097122611007507002.txt' '-o' '/tmp/graph12097122611007507002.bin' '-w' '/tmp/graph12097122611007507002.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12097122611007507002.bin' '-l' '-1' '-v' '-w' '/tmp/graph12097122611007507002.weights' '-q' '0' '-e' '0.001'
[2023-03-18 22:30:38] [INFO ] Decomposing Gal with order
[2023-03-18 22:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 22:30:38] [INFO ] Removed a total of 95 redundant transitions.
[2023-03-18 22:30:38] [INFO ] Flatten gal took : 37 ms
[2023-03-18 22:30:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 59 labels/synchronizations in 6 ms.
[2023-03-18 22:30:38] [INFO ] Time to serialize gal into /tmp/UpperBounds8665302060027397615.gal : 5 ms
[2023-03-18 22:30:38] [INFO ] Time to serialize properties into /tmp/UpperBounds4699279853237648012.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8665302060027397615.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4699279853237648012.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds4699279853237648012.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,68989,0.181088,12652,635,483,15631,5137,341,24093,101,22041,0
Total reachable state count : 68989
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 :0 <= i2.u4.p13 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-01,0,0.193027,12652,1,0,15631,5137,450,24093,123,22041,751
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 :0 <= u21.l1017 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-08,0,0.194009,12652,1,0,15631,5137,484,24093,128,22041,963
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 :0 <= i7.u20.p73 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-10,0,0.19447,12652,1,0,15631,5137,504,24093,130,22041,1041
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 :0 <= i5.i0.u12.p41 <= 1
FORMULA SieveSingleMsgMbox-PT-d1m06-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d1m06-UpperBounds-11,0,0.194651,12652,1,0,15631,5137,526,24093,130,22041,1075
Total runtime 24909 ms.
BK_STOP 1679178639391
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-5348"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d1m06, 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 r421-tajo-167905975200413"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d1m06.tgz
mv SieveSingleMsgMbox-PT-d1m06 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 ;