About the Execution of Marcie+red for DES-PT-50a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9984.176 | 3600000.00 | 3637943.00 | 8021.40 | ? 1 ? 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r106-tall-167814482800477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is DES-PT-50a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482800477
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 7.4K Feb 26 15:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 15:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 97K Mar 5 18:22 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 DES-PT-50a-UpperBounds-00
FORMULA_NAME DES-PT-50a-UpperBounds-01
FORMULA_NAME DES-PT-50a-UpperBounds-02
FORMULA_NAME DES-PT-50a-UpperBounds-03
FORMULA_NAME DES-PT-50a-UpperBounds-04
FORMULA_NAME DES-PT-50a-UpperBounds-05
FORMULA_NAME DES-PT-50a-UpperBounds-06
FORMULA_NAME DES-PT-50a-UpperBounds-07
FORMULA_NAME DES-PT-50a-UpperBounds-08
FORMULA_NAME DES-PT-50a-UpperBounds-09
FORMULA_NAME DES-PT-50a-UpperBounds-10
FORMULA_NAME DES-PT-50a-UpperBounds-11
FORMULA_NAME DES-PT-50a-UpperBounds-12
FORMULA_NAME DES-PT-50a-UpperBounds-13
FORMULA_NAME DES-PT-50a-UpperBounds-14
FORMULA_NAME DES-PT-50a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678404972023
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 23:36:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 23:36:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:36:13] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 23:36:13] [INFO ] Transformed 314 places.
[2023-03-09 23:36:13] [INFO ] Transformed 271 transitions.
[2023-03-09 23:36:13] [INFO ] Found NUPN structural information;
[2023-03-09 23:36:13] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 122 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 257 rows 314 cols
[2023-03-09 23:36:13] [INFO ] Computed 59 place invariants in 32 ms
Incomplete random walk after 10000 steps, including 230 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 16) seen :7
FORMULA DES-PT-50a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
[2023-03-09 23:36:14] [INFO ] Invariant cache hit.
[2023-03-09 23:36:14] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2023-03-09 23:36:14] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 23:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:14] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2023-03-09 23:36:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2023-03-09 23:36:14] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 73 ms returned sat
[2023-03-09 23:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:16] [INFO ] [Nat]Absence check using state equation in 1517 ms returned sat
[2023-03-09 23:36:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 23:36:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 182 ms returned sat
[2023-03-09 23:36:16] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 25 ms.
[2023-03-09 23:36:17] [INFO ] Added : 171 causal constraints over 35 iterations in 1240 ms. Result :sat
Minimization took 222 ms.
[2023-03-09 23:36:17] [INFO ] [Real]Absence check using 34 positive place invariants in 16 ms returned sat
[2023-03-09 23:36:17] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:18] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2023-03-09 23:36:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:18] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:18] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-09 23:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:19] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2023-03-09 23:36:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 688 ms returned sat
[2023-03-09 23:36:19] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 21 ms.
[2023-03-09 23:36:20] [INFO ] Added : 191 causal constraints over 39 iterations in 1202 ms. Result :sat
Minimization took 174 ms.
[2023-03-09 23:36:21] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 23:36:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:21] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 23:36:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-09 23:36:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-09 23:36:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:22] [INFO ] [Nat]Absence check using state equation in 815 ms returned sat
[2023-03-09 23:36:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-09 23:36:22] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 20 ms.
[2023-03-09 23:36:22] [INFO ] Added : 85 causal constraints over 17 iterations in 562 ms. Result :sat
Minimization took 368 ms.
[2023-03-09 23:36:23] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:23] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:23] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-03-09 23:36:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-09 23:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:24] [INFO ] [Nat]Absence check using state equation in 976 ms returned sat
[2023-03-09 23:36:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 363 ms returned sat
[2023-03-09 23:36:25] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 18 ms.
[2023-03-09 23:36:25] [INFO ] Added : 119 causal constraints over 24 iterations in 626 ms. Result :sat
Minimization took 196 ms.
[2023-03-09 23:36:25] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 23:36:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:26] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-09 23:36:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 133 ms returned sat
[2023-03-09 23:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:27] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2023-03-09 23:36:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 7 ms returned sat
[2023-03-09 23:36:27] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-09 23:36:28] [INFO ] Added : 130 causal constraints over 26 iterations in 1327 ms. Result :sat
Minimization took 163 ms.
[2023-03-09 23:36:28] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:28] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 23:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:28] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-03-09 23:36:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 81 ms returned sat
[2023-03-09 23:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:29] [INFO ] [Nat]Absence check using state equation in 853 ms returned sat
[2023-03-09 23:36:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 61 ms returned sat
[2023-03-09 23:36:30] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 23:36:30] [INFO ] Added : 134 causal constraints over 27 iterations in 846 ms. Result :sat
Minimization took 197 ms.
[2023-03-09 23:36:31] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-09 23:36:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:31] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-03-09 23:36:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 23:36:31] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 87 ms returned sat
[2023-03-09 23:36:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:32] [INFO ] [Nat]Absence check using state equation in 901 ms returned sat
[2023-03-09 23:36:32] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2023-03-09 23:36:32] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 23:36:33] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 7 ms to minimize.
[2023-03-09 23:36:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2023-03-09 23:36:33] [INFO ] Added : 102 causal constraints over 21 iterations in 833 ms. Result :sat
Minimization took 1122 ms.
[2023-03-09 23:36:34] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:34] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-09 23:36:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 109 ms returned sat
[2023-03-09 23:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:35] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-09 23:36:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 107 ms returned sat
[2023-03-09 23:36:35] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 22 ms.
[2023-03-09 23:36:36] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-09 23:36:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-03-09 23:36:36] [INFO ] Added : 73 causal constraints over 15 iterations in 1263 ms. Result :sat
Minimization took 188 ms.
[2023-03-09 23:36:36] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 23:36:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:36] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-09 23:36:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:36] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 187 ms returned sat
[2023-03-09 23:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:38] [INFO ] [Nat]Absence check using state equation in 1343 ms returned sat
[2023-03-09 23:36:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 31 ms returned sat
[2023-03-09 23:36:38] [INFO ] Computed and/alt/rep : 249/750/249 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-09 23:36:39] [INFO ] Added : 144 causal constraints over 29 iterations in 901 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 7 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 313 transition count 254
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 313 transition count 254
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 313 transition count 254
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 312 transition count 253
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 311 transition count 253
Applied a total of 12 rules in 305 ms. Remains 311 /314 variables (removed 3) and now considering 253/257 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 311/314 places, 253/257 transitions.
// Phase 1: matrix 253 rows 311 cols
[2023-03-09 23:36:42] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13669 resets, run finished after 1942 ms. (steps per millisecond=514 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2266 resets, run finished after 880 ms. (steps per millisecond=1136 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2277 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2285 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2279 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2276 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2260 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2275 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 7) seen :0
[2023-03-09 23:36:50] [INFO ] Invariant cache hit.
[2023-03-09 23:36:50] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:50] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2023-03-09 23:36:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2023-03-09 23:36:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 46 ms returned sat
[2023-03-09 23:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:50] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-09 23:36:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:36:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2023-03-09 23:36:50] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-09 23:36:51] [INFO ] Added : 198 causal constraints over 40 iterations in 784 ms. Result :sat
Minimization took 120 ms.
[2023-03-09 23:36:51] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:51] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 23:36:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:51] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-09 23:36:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:51] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:52] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 23:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:52] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-03-09 23:36:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2023-03-09 23:36:52] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2023-03-09 23:36:52] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2023-03-09 23:36:52] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2023-03-09 23:36:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 228 ms
[2023-03-09 23:36:52] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 23:36:53] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2023-03-09 23:36:53] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 0 ms to minimize.
[2023-03-09 23:36:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 164 ms
[2023-03-09 23:36:53] [INFO ] Added : 238 causal constraints over 48 iterations in 1074 ms. Result :sat
Minimization took 75 ms.
[2023-03-09 23:36:53] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:53] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-09 23:36:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-09 23:36:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:53] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-09 23:36:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 23:36:53] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-09 23:36:54] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
[2023-03-09 23:36:54] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2023-03-09 23:36:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2023-03-09 23:36:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2023-03-09 23:36:54] [INFO ] Added : 75 causal constraints over 17 iterations in 522 ms. Result :sat
Minimization took 47 ms.
[2023-03-09 23:36:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:36:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:54] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-03-09 23:36:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:36:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 72 ms returned sat
[2023-03-09 23:36:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:55] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-03-09 23:36:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-09 23:36:55] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2023-03-09 23:36:55] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-09 23:36:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2023-03-09 23:36:55] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 23:36:55] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 0 ms to minimize.
[2023-03-09 23:36:55] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2023-03-09 23:36:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 144 ms
[2023-03-09 23:36:55] [INFO ] Added : 149 causal constraints over 30 iterations in 708 ms. Result :sat
Minimization took 86 ms.
[2023-03-09 23:36:56] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:36:56] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:56] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-09 23:36:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:36:56] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-09 23:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:56] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2023-03-09 23:36:56] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-09 23:36:56] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-09 23:36:56] [INFO ] Deduced a trap composed of 8 places in 75 ms of which 0 ms to minimize.
[2023-03-09 23:36:56] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2023-03-09 23:36:56] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2023-03-09 23:36:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 250 ms
[2023-03-09 23:36:56] [INFO ] Added : 74 causal constraints over 15 iterations in 537 ms. Result :sat
Minimization took 89 ms.
[2023-03-09 23:36:57] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 23:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:57] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-09 23:36:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:57] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-09 23:36:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:57] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-09 23:36:57] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-09 23:36:57] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 17 ms.
[2023-03-09 23:36:57] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-09 23:36:57] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2023-03-09 23:36:57] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2023-03-09 23:36:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 182 ms
[2023-03-09 23:36:58] [INFO ] Added : 87 causal constraints over 19 iterations in 546 ms. Result :sat
Minimization took 54 ms.
[2023-03-09 23:36:58] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 23:36:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:36:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:58] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2023-03-09 23:36:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:36:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-09 23:36:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:58] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2023-03-09 23:36:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2023-03-09 23:36:58] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2023-03-09 23:36:58] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2023-03-09 23:36:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-09 23:36:58] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 15 ms.
[2023-03-09 23:36:59] [INFO ] Added : 188 causal constraints over 38 iterations in 721 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-50a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-50a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 17 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-09 23:37:01] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13654 resets, run finished after 1858 ms. (steps per millisecond=538 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2290 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2267 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 2) seen :0
[2023-03-09 23:37:05] [INFO ] Invariant cache hit.
[2023-03-09 23:37:05] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:05] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-03-09 23:37:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-09 23:37:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:05] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-09 23:37:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2023-03-09 23:37:05] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 16 ms.
[2023-03-09 23:37:06] [INFO ] Added : 198 causal constraints over 40 iterations in 758 ms. Result :sat
Minimization took 125 ms.
[2023-03-09 23:37:06] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:06] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-09 23:37:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:06] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-03-09 23:37:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:06] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:06] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 35 ms returned sat
[2023-03-09 23:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:07] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-09 23:37:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 23:37:07] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2023-03-09 23:37:07] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-09 23:37:07] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-09 23:37:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 217 ms
[2023-03-09 23:37:07] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 23:37:08] [INFO ] Deduced a trap composed of 50 places in 65 ms of which 1 ms to minimize.
[2023-03-09 23:37:08] [INFO ] Deduced a trap composed of 55 places in 46 ms of which 1 ms to minimize.
[2023-03-09 23:37:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 163 ms
[2023-03-09 23:37:08] [INFO ] Added : 238 causal constraints over 48 iterations in 1044 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 23:37:09] [INFO ] Invariant cache hit.
[2023-03-09 23:37:09] [INFO ] Implicit Places using invariants in 201 ms returned []
[2023-03-09 23:37:09] [INFO ] Invariant cache hit.
[2023-03-09 23:37:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:09] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-09 23:37:09] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 23:37:09] [INFO ] Invariant cache hit.
[2023-03-09 23:37:10] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 817 ms. Remains : 311/311 places, 253/253 transitions.
Starting property specific reduction for DES-PT-50a-UpperBounds-00
[2023-03-09 23:37:10] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 23:37:10] [INFO ] Invariant cache hit.
[2023-03-09 23:37:10] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-09 23:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:10] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-09 23:37:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 48 ms returned sat
[2023-03-09 23:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:10] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2023-03-09 23:37:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-09 23:37:10] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 23:37:11] [INFO ] Added : 198 causal constraints over 40 iterations in 795 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 24 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-09 23:37:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13732 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2289 resets, run finished after 807 ms. (steps per millisecond=1239 ) properties (out of 1) seen :0
[2023-03-09 23:37:14] [INFO ] Invariant cache hit.
[2023-03-09 23:37:14] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:14] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 23:37:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:14] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 23:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 23:37:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-09 23:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:15] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-09 23:37:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2023-03-09 23:37:15] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 14 ms.
[2023-03-09 23:37:15] [INFO ] Added : 198 causal constraints over 40 iterations in 752 ms. Result :sat
Minimization took 125 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 23:37:16] [INFO ] Invariant cache hit.
[2023-03-09 23:37:16] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-09 23:37:16] [INFO ] Invariant cache hit.
[2023-03-09 23:37:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:16] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-09 23:37:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:37:17] [INFO ] Invariant cache hit.
[2023-03-09 23:37:17] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 745 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-00 in 7018 ms.
Starting property specific reduction for DES-PT-50a-UpperBounds-02
[2023-03-09 23:37:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 23:37:17] [INFO ] Invariant cache hit.
[2023-03-09 23:37:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-09 23:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:17] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-09 23:37:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-09 23:37:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:17] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-09 23:37:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 23:37:17] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 0 ms to minimize.
[2023-03-09 23:37:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-09 23:37:17] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2023-03-09 23:37:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 216 ms
[2023-03-09 23:37:17] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 23:37:18] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 0 ms to minimize.
[2023-03-09 23:37:18] [INFO ] Deduced a trap composed of 55 places in 49 ms of which 0 ms to minimize.
[2023-03-09 23:37:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2023-03-09 23:37:18] [INFO ] Added : 238 causal constraints over 48 iterations in 1030 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 311/311 places, 253/253 transitions.
[2023-03-09 23:37:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13686 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2295 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 1) seen :0
[2023-03-09 23:37:21] [INFO ] Invariant cache hit.
[2023-03-09 23:37:22] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 23:37:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 23:37:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:22] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-09 23:37:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:37:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 23:37:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-09 23:37:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:37:22] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-09 23:37:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:22] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2023-03-09 23:37:22] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-09 23:37:22] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-09 23:37:22] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 4 ms to minimize.
[2023-03-09 23:37:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2023-03-09 23:37:22] [INFO ] Computed and/alt/rep : 244/410/244 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 23:37:23] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 0 ms to minimize.
[2023-03-09 23:37:23] [INFO ] Deduced a trap composed of 55 places in 50 ms of which 0 ms to minimize.
[2023-03-09 23:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 158 ms
[2023-03-09 23:37:23] [INFO ] Added : 238 causal constraints over 48 iterations in 1046 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2023-03-09 23:37:24] [INFO ] Invariant cache hit.
[2023-03-09 23:37:24] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-09 23:37:24] [INFO ] Invariant cache hit.
[2023-03-09 23:37:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 23:37:24] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-09 23:37:24] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 23:37:24] [INFO ] Invariant cache hit.
[2023-03-09 23:37:24] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 750 ms. Remains : 311/311 places, 253/253 transitions.
Ending property specific reduction for DES-PT-50a-UpperBounds-02 in 7799 ms.
[2023-03-09 23:37:25] [INFO ] Flatten gal took : 68 ms
[2023-03-09 23:37:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 23:37:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 253 transitions and 1219 arcs took 3 ms.
Total runtime 71738 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: DES_PT_50a
(NrP: 311 NrTr: 253 NrArc: 1219)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.007sec
net check time: 0m 0.000sec
init dd package: 0m 2.717sec
before gc: list nodes free: 877772
after gc: idd nodes used:709198, unused:63290802; list nodes free:288272696
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 6161708 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16097548 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
623073 1244855 1151164
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="DES-PT-50a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is DES-PT-50a, 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 r106-tall-167814482800477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;