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.r377-smll-171683809700109.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 greatspnxred
Input is SieveSingleMsgMbox-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r377-smll-171683809700109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 19:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 19:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 19:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 12 19:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.1M May 18 16:43 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716914828720

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d2m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 16:47:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 16:47:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 16:47:11] [INFO ] Load time of PNML (sax parser for PT used): 639 ms
[2024-05-28 16:47:11] [INFO ] Transformed 2398 places.
[2024-05-28 16:47:11] [INFO ] Transformed 1954 transitions.
[2024-05-28 16:47:11] [INFO ] Parsed PT model containing 2398 places and 1954 transitions and 7816 arcs in 902 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 19 ms.
Deduced a syphon composed of 1984 places in 34 ms
Reduce places removed 1984 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 1954 rows 414 cols
[2024-05-28 16:47:11] [INFO ] Computed 6 invariants in 100 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 10000 steps (2189 resets) in 383 ms. (26 steps per ms)
BEST_FIRST walk for 30003 steps (2835 resets) in 242 ms. (123 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 16:47:12] [INFO ] Invariant cache hit.
[2024-05-28 16:47:12] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2024-05-28 16:47:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-28 16:47:13] [INFO ] [Real]Absence check using state equation in 976 ms returned sat
[2024-05-28 16:47:14] [INFO ] State equation strengthened by 1674 read => feed constraints.
[2024-05-28 16:47:14] [INFO ] [Real]Added 1674 Read/Feed constraints in 626 ms returned sat
[2024-05-28 16:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 16:47:15] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 16:47:15] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2024-05-28 16:47:16] [INFO ] [Nat]Added 1674 Read/Feed constraints in 1168 ms returned sat
[2024-05-28 16:47:17] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 644 ms.
[2024-05-28 16:47:19] [INFO ] Deduced a trap composed of 24 places in 765 ms of which 70 ms to minimize.
[2024-05-28 16:47:19] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 945 ms
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-28 16:47:20] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 16:47:20] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 16:47:20] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2024-05-28 16:47:21] [INFO ] [Real]Added 1674 Read/Feed constraints in 404 ms returned sat
[2024-05-28 16:47:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-28 16:47:21] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-28 16:47:22] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2024-05-28 16:47:22] [INFO ] [Nat]Added 1674 Read/Feed constraints in 836 ms returned sat
[2024-05-28 16:47:23] [INFO ] Deduced a trap composed of 45 places in 579 ms of which 8 ms to minimize.
[2024-05-28 16:47:24] [INFO ] Deduced a trap composed of 44 places in 558 ms of which 7 ms to minimize.
[2024-05-28 16:47:24] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 1840 ms
[2024-05-28 16:47:24] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-28 16:47:24] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2024-05-28 16:47:25] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2024-05-28 16:47:26] [INFO ] [Real]Added 1674 Read/Feed constraints in 622 ms returned sat
[2024-05-28 16:47:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-28 16:47:26] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-28 16:47:27] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2024-05-28 16:47:27] [INFO ] [Nat]Added 1674 Read/Feed constraints in 684 ms returned sat
[2024-05-28 16:47:28] [INFO ] Computed and/alt/rep : 141/395/141 causal constraints (skipped 1812 transitions) in 277 ms.
[2024-05-28 16:47:29] [INFO ] Deduced a trap composed of 24 places in 656 ms of which 8 ms to minimize.
[2024-05-28 16:47:30] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 1234 ms
Maximisation of solution failed !
Minimization took 0 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1954/1954 transitions.
Graph (complete) has 2618 edges and 414 vertex of which 388 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.14 ms
Discarding 26 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 828 transitions
Reduce isomorphic transitions removed 830 transitions.
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 388 transition count 1124
Discarding 119 places :
Symmetric choice reduction at 1 with 119 rule applications. Total rules 950 place count 269 transition count 372
Iterating global reduction 1 with 119 rules applied. Total rules applied 1069 place count 269 transition count 372
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 1079 place count 269 transition count 362
Discarding 90 places :
Symmetric choice reduction at 2 with 90 rule applications. Total rules 1169 place count 179 transition count 272
Iterating global reduction 2 with 90 rules applied. Total rules applied 1259 place count 179 transition count 272
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 2 with 34 rules applied. Total rules applied 1293 place count 179 transition count 238
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 1330 place count 142 transition count 188
Iterating global reduction 3 with 37 rules applied. Total rules applied 1367 place count 142 transition count 188
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 1389 place count 142 transition count 166
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1397 place count 134 transition count 154
Iterating global reduction 4 with 8 rules applied. Total rules applied 1405 place count 134 transition count 154
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 1413 place count 126 transition count 146
Iterating global reduction 4 with 8 rules applied. Total rules applied 1421 place count 126 transition count 146
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 1425 place count 122 transition count 141
Iterating global reduction 4 with 4 rules applied. Total rules applied 1429 place count 122 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1430 place count 122 transition count 140
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 1434 place count 118 transition count 136
Iterating global reduction 5 with 4 rules applied. Total rules applied 1438 place count 118 transition count 136
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1441 place count 115 transition count 133
Iterating global reduction 5 with 3 rules applied. Total rules applied 1444 place count 115 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1445 place count 114 transition count 132
Iterating global reduction 5 with 1 rules applied. Total rules applied 1446 place count 114 transition count 132
Applied a total of 1446 rules in 285 ms. Remains 114 /414 variables (removed 300) and now considering 132/1954 (removed 1822) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 114/414 places, 132/1954 transitions.
// Phase 1: matrix 132 rows 114 cols
[2024-05-28 16:47:31] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224183 resets) in 1577 ms. (633 steps per ms)
BEST_FIRST walk for 3000002 steps (310407 resets) in 1819 ms. (1648 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 16:47:35] [INFO ] Invariant cache hit.
[2024-05-28 16:47:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 16:47:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:47:35] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2024-05-28 16:47:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 16:47:35] [INFO ] [Real]Added 49 Read/Feed constraints in 17 ms returned sat
[2024-05-28 16:47:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 16:47:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-28 16:47:35] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-05-28 16:47:35] [INFO ] [Nat]Added 49 Read/Feed constraints in 25 ms returned sat
[2024-05-28 16:47:35] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 20 ms.
[2024-05-28 16:47:35] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-28 16:47:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2024-05-28 16:47:35] [INFO ] Added : 15 causal constraints over 3 iterations in 269 ms. Result :sat
Minimization took 140 ms.
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Added 49 Read/Feed constraints in 28 ms returned sat
[2024-05-28 16:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Nat]Added 49 Read/Feed constraints in 18 ms returned sat
[2024-05-28 16:47:36] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-28 16:47:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-28 16:47:36] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 29 ms.
[2024-05-28 16:47:36] [INFO ] Added : 12 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 115 ms.
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-28 16:47:36] [INFO ] [Real]Added 49 Read/Feed constraints in 19 ms returned sat
[2024-05-28 16:47:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:47:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-28 16:47:37] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-28 16:47:37] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2024-05-28 16:47:37] [INFO ] [Nat]Added 49 Read/Feed constraints in 30 ms returned sat
[2024-05-28 16:47:37] [INFO ] Computed and/alt/rep : 31/86/31 causal constraints (skipped 100 transitions) in 20 ms.
[2024-05-28 16:47:37] [INFO ] Added : 13 causal constraints over 3 iterations in 106 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 18 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 114/114 places, 132/132 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 132/132 transitions.
Applied a total of 0 rules in 18 ms. Remains 114 /114 variables (removed 0) and now considering 132/132 (removed 0) transitions.
[2024-05-28 16:47:37] [INFO ] Invariant cache hit.
[2024-05-28 16:47:37] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-28 16:47:37] [INFO ] Invariant cache hit.
[2024-05-28 16:47:37] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-28 16:47:38] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-28 16:47:38] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-28 16:47:38] [INFO ] Invariant cache hit.
[2024-05-28 16:47:38] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 1/114 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:47:41] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/246 variables, 114/119 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 49/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:47:45] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD119 is UNSAT
At refinement iteration 9 (OVERLAPS) 0/246 variables, 2/170 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-05-28 16:47:49] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-28 16:47:49] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 2/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 172 constraints, problems are : Problem set: 3 solved, 128 unsolved in 17750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (OVERLAPS) 4/114 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 2/6 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 3/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 132/246 variables, 114/123 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 49/172 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 128/300 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-05-28 16:48:01] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 1/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/301 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 301 constraints, problems are : Problem set: 3 solved, 128 unsolved in 21499 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 6/6 constraints]
After SMT, in 39756ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 39774ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 114/114 places, 129/132 transitions.
Graph (complete) has 322 edges and 114 vertex of which 111 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 111 /114 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 111 cols
[2024-05-28 16:48:17] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 16:48:18] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-28 16:48:18] [INFO ] Invariant cache hit.
[2024-05-28 16:48:18] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 16:48:18] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/114 places, 129/132 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 40858 ms. Remains : 111/114 places, 129/132 transitions.
[2024-05-28 16:48:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224461 resets) in 1314 ms. (760 steps per ms)
BEST_FIRST walk for 3000002 steps (310090 resets) in 2000 ms. (1499 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 16:48:21] [INFO ] Invariant cache hit.
[2024-05-28 16:48:21] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 16:48:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-05-28 16:48:21] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 16:48:21] [INFO ] [Real]Added 48 Read/Feed constraints in 20 ms returned sat
[2024-05-28 16:48:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:48:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Nat]Absence check using state equation in 95 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 22 ms returned sat
[2024-05-28 16:48:22] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 18 ms.
[2024-05-28 16:48:22] [INFO ] Added : 12 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 103 ms.
[2024-05-28 16:48:22] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Real]Added 48 Read/Feed constraints in 21 ms returned sat
[2024-05-28 16:48:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:48:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-28 16:48:22] [INFO ] [Nat]Added 48 Read/Feed constraints in 32 ms returned sat
[2024-05-28 16:48:22] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 3 ms to minimize.
[2024-05-28 16:48:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-28 16:48:22] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 18 ms.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 4 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2024-05-28 16:48:23] [INFO ] Added : 20 causal constraints over 4 iterations in 254 ms. Result :sat
Minimization took 94 ms.
[2024-05-28 16:48:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:48:23] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2024-05-28 16:48:23] [INFO ] [Real]Added 48 Read/Feed constraints in 15 ms returned sat
[2024-05-28 16:48:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:48:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:48:23] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2024-05-28 16:48:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 27 ms returned sat
[2024-05-28 16:48:23] [INFO ] Computed and/alt/rep : 30/81/30 causal constraints (skipped 98 transitions) in 17 ms.
[2024-05-28 16:48:23] [INFO ] Deduced a trap composed of 14 places in 123 ms of which 2 ms to minimize.
[2024-05-28 16:48:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2024-05-28 16:48:23] [INFO ] Added : 16 causal constraints over 4 iterations in 286 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 11 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 111/111 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 129/129 transitions.
Applied a total of 0 rules in 12 ms. Remains 111 /111 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-05-28 16:48:24] [INFO ] Invariant cache hit.
[2024-05-28 16:48:24] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-28 16:48:24] [INFO ] Invariant cache hit.
[2024-05-28 16:48:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2024-05-28 16:48:24] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
[2024-05-28 16:48:24] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
[2024-05-28 16:48:24] [INFO ] Invariant cache hit.
[2024-05-28 16:48:24] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-05-28 16:48:26] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 5 (OVERLAPS) 129/240 variables, 111/115 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 48/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 0/240 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 163 constraints, problems are : Problem set: 3 solved, 125 unsolved in 7786 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/108 variables, 2/3 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/4 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 16:48:33] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 16:48:34] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 128/236 variables, 108/114 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 47/161 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 16/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 11 (OVERLAPS) 4/240 variables, 3/180 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/181 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 109/290 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 16:48:42] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 1 ms to minimize.
[2024-05-28 16:48:43] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2024-05-28 16:48:43] [INFO ] Deduced a trap composed of 51 places in 63 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 3/293 constraints. Problems are: Problem set: 3 solved, 125 unsolved
[2024-05-28 16:48:48] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/240 variables, 1/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
At refinement iteration 17 (OVERLAPS) 0/240 variables, 0/294 constraints. Problems are: Problem set: 3 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 294 constraints, problems are : Problem set: 3 solved, 125 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 125/128 constraints, Known Traps: 7/7 constraints]
After SMT, in 38038ms problems are : Problem set: 3 solved, 125 unsolved
Search for dead transitions found 3 dead transitions in 38041ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 111/111 places, 126/129 transitions.
Graph (complete) has 313 edges and 111 vertex of which 108 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 108 /111 variables (removed 3) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 108 cols
[2024-05-28 16:49:02] [INFO ] Computed 3 invariants in 2 ms
[2024-05-28 16:49:02] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-28 16:49:02] [INFO ] Invariant cache hit.
[2024-05-28 16:49:02] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 16:49:03] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/111 places, 126/129 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39049 ms. Remains : 108/111 places, 126/129 transitions.
[2024-05-28 16:49:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
RANDOM walk for 1000000 steps (224313 resets) in 1110 ms. (900 steps per ms)
BEST_FIRST walk for 3000002 steps (310088 resets) in 1740 ms. (1723 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[42, 1, 42]
[2024-05-28 16:49:06] [INFO ] Invariant cache hit.
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-28 16:49:06] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-28 16:49:06] [INFO ] [Real]Added 47 Read/Feed constraints in 11 ms returned sat
[2024-05-28 16:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Added 47 Read/Feed constraints in 12 ms returned sat
[2024-05-28 16:49:06] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 11 ms.
[2024-05-28 16:49:06] [INFO ] Added : 10 causal constraints over 2 iterations in 55 ms. Result :sat
Minimization took 105 ms.
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Added 47 Read/Feed constraints in 24 ms returned sat
[2024-05-28 16:49:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Nat]Added 47 Read/Feed constraints in 30 ms returned sat
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-28 16:49:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 137 ms
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:06] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-28 16:49:07] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-28 16:49:07] [INFO ] [Real]Added 47 Read/Feed constraints in 10 ms returned sat
[2024-05-28 16:49:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-28 16:49:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-28 16:49:07] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-28 16:49:07] [INFO ] [Nat]Added 47 Read/Feed constraints in 18 ms returned sat
[2024-05-28 16:49:07] [INFO ] Computed and/alt/rep : 29/75/29 causal constraints (skipped 96 transitions) in 12 ms.
[2024-05-28 16:49:07] [INFO ] Added : 15 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[42, 0, 42]
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 126/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 107 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 107 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 106 transition count 122
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 106 transition count 122
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 105 transition count 121
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 105 transition count 121
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 104 transition count 120
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 104 transition count 120
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 103 transition count 119
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 103 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 102 transition count 118
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 102 transition count 118
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 101 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 101 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 100 transition count 114
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 100 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 99 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 99 transition count 113
Applied a total of 19 rules in 41 ms. Remains 99 /108 variables (removed 9) and now considering 113/126 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 99/108 places, 113/126 transitions.
// Phase 1: matrix 113 rows 99 cols
[2024-05-28 16:49:07] [INFO ] Computed 3 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[42, 42]
RANDOM walk for 1000000 steps (224920 resets) in 1712 ms. (583 steps per ms)
BEST_FIRST walk for 2000000 steps (206279 resets) in 1102 ms. (1813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[42, 42]
[2024-05-28 16:49:10] [INFO ] Invariant cache hit.
[2024-05-28 16:49:10] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:10] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-28 16:49:10] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 16:49:10] [INFO ] [Real]Added 42 Read/Feed constraints in 11 ms returned sat
[2024-05-28 16:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:49:10] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-28 16:49:10] [INFO ] [Nat]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-05-28 16:49:10] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 15 ms.
[2024-05-28 16:49:10] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-05-28 16:49:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-28 16:49:10] [INFO ] Added : 17 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 91 ms.
[2024-05-28 16:49:10] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:49:10] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2024-05-28 16:49:10] [INFO ] [Real]Added 42 Read/Feed constraints in 19 ms returned sat
[2024-05-28 16:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:11] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-28 16:49:11] [INFO ] [Nat]Added 42 Read/Feed constraints in 25 ms returned sat
[2024-05-28 16:49:11] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 14 ms.
[2024-05-28 16:49:11] [INFO ] Added : 20 causal constraints over 4 iterations in 107 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[42, 42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[42, 42]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 99/99 places, 113/113 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 99 /99 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2024-05-28 16:49:11] [INFO ] Invariant cache hit.
[2024-05-28 16:49:11] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 16:49:11] [INFO ] Invariant cache hit.
[2024-05-28 16:49:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 16:49:11] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
[2024-05-28 16:49:11] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-28 16:49:11] [INFO ] Invariant cache hit.
[2024-05-28 16:49:11] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-28 16:49:13] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/212 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 145 constraints, problems are : Problem set: 0 solved, 112 unsolved in 6591 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 113/212 variables, 99/103 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 42/145 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 112/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/212 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 257 constraints, problems are : Problem set: 0 solved, 112 unsolved in 11289 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints]
After SMT, in 18113ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 18116ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18702 ms. Remains : 99/99 places, 113/113 transitions.
RANDOM walk for 40000 steps (8909 resets) in 1090 ms. (36 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4180 resets) in 703 ms. (56 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4122 resets) in 325 ms. (122 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4197 resets) in 206 ms. (193 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4094 resets) in 210 ms. (189 steps per ms) remains 4/4 properties
Probably explored full state space saw : 120031 states, properties seen :2
Probabilistic random walk after 302520 steps, saw 120031 distinct states, run finished after 1572 ms. (steps per millisecond=192 ) properties seen :2
Explored full state space saw : 120031 states, properties seen :0
Exhaustive walk after 302520 steps, saw 120031 distinct states, run finished after 936 ms. (steps per millisecond=323 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0] Max Struct:[42, 42]
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00
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:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
[2024-05-28 16:49:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2229 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (1051 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 16:49:33] [INFO ] Invariant cache hit.
[2024-05-28 16:49:33] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:33] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 16:49:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 16:49:33] [INFO ] [Real]Added 42 Read/Feed constraints in 9 ms returned sat
[2024-05-28 16:49:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:33] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 16:49:33] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2024-05-28 16:49:33] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 8 ms.
[2024-05-28 16:49:33] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 2 ms to minimize.
[2024-05-28 16:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-28 16:49:33] [INFO ] Added : 17 causal constraints over 4 iterations in 150 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 97 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 97 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 96 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 96 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 95 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 95 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 94 transition count 105
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 94 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 94 transition count 104
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 14 place count 93 transition count 103
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 93 transition count 103
Applied a total of 15 rules in 27 ms. Remains 93 /99 variables (removed 6) and now considering 103/113 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 93/99 places, 103/113 transitions.
// Phase 1: matrix 103 rows 93 cols
[2024-05-28 16:49:34] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224314 resets) in 1326 ms. (753 steps per ms)
BEST_FIRST walk for 1000000 steps (103289 resets) in 498 ms. (2004 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 16:49:35] [INFO ] Invariant cache hit.
[2024-05-28 16:49:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:49:35] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-28 16:49:35] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 16:49:36] [INFO ] [Real]Added 38 Read/Feed constraints in 16 ms returned sat
[2024-05-28 16:49:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-28 16:49:36] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-05-28 16:49:36] [INFO ] [Nat]Added 38 Read/Feed constraints in 19 ms returned sat
[2024-05-28 16:49:36] [INFO ] Computed and/alt/rep : 24/59/24 causal constraints (skipped 78 transitions) in 14 ms.
[2024-05-28 16:49:36] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-28 16:49:36] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 3 ms to minimize.
[2024-05-28 16:49:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2024-05-28 16:49:36] [INFO ] Added : 14 causal constraints over 3 iterations in 268 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 93/93 places, 103/103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 93 /93 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-28 16:49:36] [INFO ] Invariant cache hit.
[2024-05-28 16:49:36] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-28 16:49:36] [INFO ] Invariant cache hit.
[2024-05-28 16:49:36] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-28 16:49:37] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
[2024-05-28 16:49:37] [INFO ] Redundant transitions in 3 ms returned []
Running 102 sub problems to find dead transitions.
[2024-05-28 16:49:37] [INFO ] Invariant cache hit.
[2024-05-28 16:49:37] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 16:49:38] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/196 variables, 93/97 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 38/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 102 unsolved
[2024-05-28 16:49:41] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
[2024-05-28 16:49:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/196 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 137 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8814 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (OVERLAPS) 1/93 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (OVERLAPS) 103/196 variables, 93/99 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 38/137 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 102/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (OVERLAPS) 0/196 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 239 constraints, problems are : Problem set: 0 solved, 102 unsolved in 10924 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints]
After SMT, in 19940ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 19943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20455 ms. Remains : 93/93 places, 103/103 transitions.
RANDOM walk for 40000 steps (8940 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4255 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4038 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
Probably explored full state space saw : 95259 states, properties seen :1
Probabilistic random walk after 235248 steps, saw 95259 distinct states, run finished after 281 ms. (steps per millisecond=837 ) properties seen :1
Explored full state space saw : 95259 states, properties seen :0
Exhaustive walk after 235248 steps, saw 95259 distinct states, run finished after 195 ms. (steps per millisecond=1206 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 in 24104 ms.
Starting property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14
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:[42]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[42]
// Phase 1: matrix 113 rows 99 cols
[2024-05-28 16:49:57] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 10000 steps (2242 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (1043 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 16:49:57] [INFO ] Invariant cache hit.
[2024-05-28 16:49:57] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:57] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2024-05-28 16:49:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-28 16:49:57] [INFO ] [Real]Added 42 Read/Feed constraints in 13 ms returned sat
[2024-05-28 16:49:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:49:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-28 16:49:57] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-28 16:49:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 14 ms returned sat
[2024-05-28 16:49:57] [INFO ] Computed and/alt/rep : 26/67/26 causal constraints (skipped 86 transitions) in 7 ms.
[2024-05-28 16:49:57] [INFO ] Added : 20 causal constraints over 4 iterations in 68 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 113/113 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 97 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 97 transition count 109
Applied a total of 5 rules in 8 ms. Remains 97 /99 variables (removed 2) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 97/99 places, 109/113 transitions.
// Phase 1: matrix 109 rows 97 cols
[2024-05-28 16:49:58] [INFO ] Computed 3 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[42]
RANDOM walk for 1000000 steps (224978 resets) in 1164 ms. (858 steps per ms)
BEST_FIRST walk for 1000000 steps (103715 resets) in 701 ms. (1424 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[42]
[2024-05-28 16:49:59] [INFO ] Invariant cache hit.
[2024-05-28 16:49:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:49:59] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-28 16:49:59] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 16:49:59] [INFO ] [Real]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-05-28 16:49:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 16:50:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-28 16:50:00] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-05-28 16:50:00] [INFO ] [Nat]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-28 16:50:00] [INFO ] Computed and/alt/rep : 25/64/25 causal constraints (skipped 83 transitions) in 8 ms.
[2024-05-28 16:50:00] [INFO ] Added : 13 causal constraints over 3 iterations in 50 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[42]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[42]
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 97/97 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-28 16:50:00] [INFO ] Invariant cache hit.
[2024-05-28 16:50:00] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-28 16:50:00] [INFO ] Invariant cache hit.
[2024-05-28 16:50:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-28 16:50:00] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
[2024-05-28 16:50:00] [INFO ] Redundant transitions in 7 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-28 16:50:00] [INFO ] Invariant cache hit.
[2024-05-28 16:50:00] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-28 16:50:02] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/206 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 142 constraints, problems are : Problem set: 0 solved, 108 unsolved in 5994 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/101 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 41/142 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 108/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 250 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9828 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 97/97 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 1/1 constraints]
After SMT, in 15993ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 16001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16531 ms. Remains : 97/97 places, 109/109 transitions.
RANDOM walk for 40000 steps (8941 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4045 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4144 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Probably explored full state space saw : 96730 states, properties seen :1
Probabilistic random walk after 239870 steps, saw 96730 distinct states, run finished after 268 ms. (steps per millisecond=895 ) properties seen :1
Explored full state space saw : 96730 states, properties seen :0
Exhaustive walk after 239870 steps, saw 96730 distinct states, run finished after 190 ms. (steps per millisecond=1262 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[42]
Ending property specific reduction for SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 in 19681 ms.
[2024-05-28 16:50:17] [INFO ] Flatten gal took : 52 ms
[2024-05-28 16:50:17] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 6 ms.
[2024-05-28 16:50:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 99 places, 113 transitions and 448 arcs took 6 ms.
Total runtime 187037 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running SieveSingleMsgMbox-PT-d2m06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 99
TRANSITIONS: 113
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 879
MODEL NAME: /home/mcc/execution/416/model
99 places, 113 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA SieveSingleMsgMbox-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716915019264

--------------------
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

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-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is SieveSingleMsgMbox-PT-d2m06, 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 r377-smll-171683809700109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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