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-167814482700445.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-30a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482700445
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 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 70K 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-30a-UpperBounds-00
FORMULA_NAME DES-PT-30a-UpperBounds-01
FORMULA_NAME DES-PT-30a-UpperBounds-02
FORMULA_NAME DES-PT-30a-UpperBounds-03
FORMULA_NAME DES-PT-30a-UpperBounds-04
FORMULA_NAME DES-PT-30a-UpperBounds-05
FORMULA_NAME DES-PT-30a-UpperBounds-06
FORMULA_NAME DES-PT-30a-UpperBounds-07
FORMULA_NAME DES-PT-30a-UpperBounds-08
FORMULA_NAME DES-PT-30a-UpperBounds-09
FORMULA_NAME DES-PT-30a-UpperBounds-10
FORMULA_NAME DES-PT-30a-UpperBounds-11
FORMULA_NAME DES-PT-30a-UpperBounds-12
FORMULA_NAME DES-PT-30a-UpperBounds-13
FORMULA_NAME DES-PT-30a-UpperBounds-14
FORMULA_NAME DES-PT-30a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678393973279

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-30a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 20:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 20:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 20:32:55] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-09 20:32:55] [INFO ] Transformed 234 places.
[2023-03-09 20:32:55] [INFO ] Transformed 191 transitions.
[2023-03-09 20:32:55] [INFO ] Found NUPN structural information;
[2023-03-09 20:32:55] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 141 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 177 rows 234 cols
[2023-03-09 20:32:55] [INFO ] Computed 59 place invariants in 26 ms
Incomplete random walk after 10000 steps, including 225 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 16) seen :11
FORMULA DES-PT-30a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 5) seen :0
[2023-03-09 20:32:55] [INFO ] Invariant cache hit.
[2023-03-09 20:32:55] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2023-03-09 20:32:55] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-09 20:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:55] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-09 20:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:32:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 20:32:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 75 ms returned sat
[2023-03-09 20:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:56] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-09 20:32:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-09 20:32:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 48 ms returned sat
[2023-03-09 20:32:56] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 3 ms to minimize.
[2023-03-09 20:32:56] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 0 ms to minimize.
[2023-03-09 20:32:56] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:32:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2023-03-09 20:32:56] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 15 ms.
[2023-03-09 20:32:57] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
[2023-03-09 20:32:57] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:32:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-09 20:32:57] [INFO ] Added : 158 causal constraints over 32 iterations in 910 ms. Result :sat
Minimization took 82 ms.
[2023-03-09 20:32:57] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2023-03-09 20:32:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:57] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-09 20:32:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:32:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2023-03-09 20:32:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 69 ms returned sat
[2023-03-09 20:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:58] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-09 20:32:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:32:58] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 17 ms.
[2023-03-09 20:32:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-09 20:32:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2023-03-09 20:32:58] [INFO ] Added : 67 causal constraints over 14 iterations in 381 ms. Result :sat
Minimization took 119 ms.
[2023-03-09 20:32:58] [INFO ] [Real]Absence check using 34 positive place invariants in 8 ms returned sat
[2023-03-09 20:32:58] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-09 20:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:58] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-09 20:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:32:58] [INFO ] [Nat]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 20:32:58] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 66 ms returned sat
[2023-03-09 20:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-09 20:32:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 47 ms returned sat
[2023-03-09 20:32:59] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 19 ms.
[2023-03-09 20:32:59] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2023-03-09 20:32:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-03-09 20:32:59] [INFO ] Added : 98 causal constraints over 21 iterations in 482 ms. Result :sat
Minimization took 126 ms.
[2023-03-09 20:32:59] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 20:32:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-09 20:32:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:32:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-09 20:32:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:32:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 20:32:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 73 ms returned sat
[2023-03-09 20:32:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:00] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-09 20:33:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-09 20:33:00] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 14 ms.
[2023-03-09 20:33:00] [INFO ] Added : 84 causal constraints over 18 iterations in 410 ms. Result :sat
Minimization took 65 ms.
[2023-03-09 20:33:00] [INFO ] [Real]Absence check using 34 positive place invariants in 6 ms returned sat
[2023-03-09 20:33:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-09 20:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:00] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-09 20:33:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-09 20:33:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2023-03-09 20:33:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:01] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-09 20:33:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:01] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2023-03-09 20:33:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2023-03-09 20:33:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 124 ms
[2023-03-09 20:33:01] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-09 20:33:01] [INFO ] Added : 117 causal constraints over 24 iterations in 488 ms. Result :sat
Minimization took 106 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA DES-PT-30a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
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 233 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 232 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 231 transition count 173
Applied a total of 12 rules in 70 ms. Remains 231 /234 variables (removed 3) and now considering 173/177 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 231/234 places, 173/177 transitions.
// Phase 1: matrix 173 rows 231 cols
[2023-03-09 20:33:02] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13645 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2293 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2271 resets, run finished after 896 ms. (steps per millisecond=1116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2322 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2282 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 4) seen :0
[2023-03-09 20:33:08] [INFO ] Invariant cache hit.
[2023-03-09 20:33:08] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:08] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-09 20:33:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:33:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-09 20:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:08] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-09 20:33:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-09 20:33:08] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 13 ms.
[2023-03-09 20:33:08] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2023-03-09 20:33:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-09 20:33:09] [INFO ] Added : 149 causal constraints over 31 iterations in 520 ms. Result :sat
Minimization took 57 ms.
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-09 20:33:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 102 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:09] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2023-03-09 20:33:09] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 20:33:09] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:33:09] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2023-03-09 20:33:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2023-03-09 20:33:09] [INFO ] Added : 60 causal constraints over 13 iterations in 325 ms. Result :sat
Minimization took 70 ms.
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:09] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-09 20:33:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:10] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2023-03-09 20:33:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:10] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2023-03-09 20:33:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:10] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-09 20:33:10] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-09 20:33:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2023-03-09 20:33:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
[2023-03-09 20:33:10] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 8 ms.
[2023-03-09 20:33:10] [INFO ] Added : 108 causal constraints over 22 iterations in 316 ms. Result :sat
Minimization took 45 ms.
[2023-03-09 20:33:10] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:10] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:33:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2023-03-09 20:33:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:10] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:33:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-09 20:33:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:11] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-09 20:33:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2023-03-09 20:33:11] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 17 ms.
[2023-03-09 20:33:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-09 20:33:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-09 20:33:11] [INFO ] Added : 111 causal constraints over 23 iterations in 435 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA DES-PT-30a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 22 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-09 20:33:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13721 resets, run finished after 1818 ms. (steps per millisecond=550 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2283 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2293 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2245 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 3) seen :0
[2023-03-09 20:33:16] [INFO ] Invariant cache hit.
[2023-03-09 20:33:16] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:17] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 20:33:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-09 20:33:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 20:33:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:17] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-09 20:33:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-09 20:33:17] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 20:33:17] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2023-03-09 20:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-09 20:33:17] [INFO ] Added : 149 causal constraints over 31 iterations in 509 ms. Result :sat
Minimization took 58 ms.
[2023-03-09 20:33:17] [INFO ] [Real]Absence check using 35 positive place invariants in 9 ms returned sat
[2023-03-09 20:33:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:17] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-09 20:33:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 52 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:18] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2023-03-09 20:33:18] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:33:18] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2023-03-09 20:33:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2023-03-09 20:33:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 187 ms
[2023-03-09 20:33:18] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 8 ms.
[2023-03-09 20:33:18] [INFO ] Added : 108 causal constraints over 22 iterations in 304 ms. Result :sat
Minimization took 43 ms.
[2023-03-09 20:33:18] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:18] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-09 20:33:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-09 20:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:19] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-09 20:33:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-09 20:33:19] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 20:33:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-09 20:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-09 20:33:19] [INFO ] Added : 111 causal constraints over 23 iterations in 402 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:33:20] [INFO ] Invariant cache hit.
[2023-03-09 20:33:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-09 20:33:20] [INFO ] Invariant cache hit.
[2023-03-09 20:33:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:20] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-09 20:33:20] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:33:20] [INFO ] Invariant cache hit.
[2023-03-09 20:33:20] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 493 ms. Remains : 231/231 places, 173/173 transitions.
Starting property specific reduction for DES-PT-30a-UpperBounds-00
[2023-03-09 20:33:20] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-09 20:33:20] [INFO ] Invariant cache hit.
[2023-03-09 20:33:20] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-09 20:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:20] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-09 20:33:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2023-03-09 20:33:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:21] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-09 20:33:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:21] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 7 ms.
[2023-03-09 20:33:21] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-09 20:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-09 20:33:21] [INFO ] Added : 149 causal constraints over 31 iterations in 518 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-09 20:33:21] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13670 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 1) seen :0
[2023-03-09 20:33:24] [INFO ] Invariant cache hit.
[2023-03-09 20:33:24] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:24] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-09 20:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2023-03-09 20:33:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 20:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:24] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-03-09 20:33:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:24] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 11 ms.
[2023-03-09 20:33:25] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2023-03-09 20:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-09 20:33:25] [INFO ] Added : 149 causal constraints over 31 iterations in 493 ms. Result :sat
Minimization took 55 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:33:25] [INFO ] Invariant cache hit.
[2023-03-09 20:33:25] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-09 20:33:25] [INFO ] Invariant cache hit.
[2023-03-09 20:33:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:26] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-09 20:33:26] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:33:26] [INFO ] Invariant cache hit.
[2023-03-09 20:33:26] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-00 in 5481 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-06
[2023-03-09 20:33:26] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 128 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 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-09 20:33:26] [INFO ] Invariant cache hit.
[2023-03-09 20:33:26] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-09 20:33:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:26] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-09 20:33:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 56 ms returned sat
[2023-03-09 20:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:26] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-09 20:33:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-09 20:33:26] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-09 20:33:26] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 0 ms to minimize.
[2023-03-09 20:33:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-09 20:33:26] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 20:33:27] [INFO ] Added : 108 causal constraints over 22 iterations in 308 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-09 20:33:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13722 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2248 resets, run finished after 916 ms. (steps per millisecond=1091 ) properties (out of 1) seen :0
[2023-03-09 20:33:30] [INFO ] Invariant cache hit.
[2023-03-09 20:33:30] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:30] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-09 20:33:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:30] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 53 ms returned sat
[2023-03-09 20:33:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:30] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-09 20:33:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2023-03-09 20:33:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2023-03-09 20:33:30] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2023-03-09 20:33:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 0 ms to minimize.
[2023-03-09 20:33:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2023-03-09 20:33:30] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 8 ms.
[2023-03-09 20:33:31] [INFO ] Added : 108 causal constraints over 22 iterations in 308 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 7 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:33:31] [INFO ] Invariant cache hit.
[2023-03-09 20:33:31] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-09 20:33:31] [INFO ] Invariant cache hit.
[2023-03-09 20:33:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:31] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2023-03-09 20:33:31] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 20:33:31] [INFO ] Invariant cache hit.
[2023-03-09 20:33:31] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-06 in 5606 ms.
Starting property specific reduction for DES-PT-30a-UpperBounds-14
[2023-03-09 20:33:31] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 139 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 21 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-09 20:33:31] [INFO ] Invariant cache hit.
[2023-03-09 20:33:31] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:31] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:31] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 20:33:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:32] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 55 ms returned sat
[2023-03-09 20:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:32] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-09 20:33:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:32] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-09 20:33:32] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 10 ms.
[2023-03-09 20:33:32] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2023-03-09 20:33:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-09 20:33:32] [INFO ] Added : 111 causal constraints over 23 iterations in 413 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
[2023-03-09 20:33:32] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 13694 resets, run finished after 1760 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2246 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 1) seen :0
[2023-03-09 20:33:35] [INFO ] Invariant cache hit.
[2023-03-09 20:33:35] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-09 20:33:35] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-09 20:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:35] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 20:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 20:33:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-09 20:33:35] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 66 ms returned sat
[2023-03-09 20:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 20:33:35] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-09 20:33:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2023-03-09 20:33:35] [INFO ] Computed and/alt/rep : 164/290/164 causal constraints (skipped 6 transitions) in 12 ms.
[2023-03-09 20:33:36] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 20:33:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-09 20:33:36] [INFO ] Added : 111 causal constraints over 23 iterations in 435 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 6 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 5 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2023-03-09 20:33:36] [INFO ] Invariant cache hit.
[2023-03-09 20:33:36] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-09 20:33:36] [INFO ] Invariant cache hit.
[2023-03-09 20:33:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-09 20:33:37] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-09 20:33:37] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 20:33:37] [INFO ] Invariant cache hit.
[2023-03-09 20:33:37] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 231/231 places, 173/173 transitions.
Ending property specific reduction for DES-PT-30a-UpperBounds-14 in 5361 ms.
[2023-03-09 20:33:37] [INFO ] Flatten gal took : 48 ms
[2023-03-09 20:33:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 20:33:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 231 places, 173 transitions and 839 arcs took 2 ms.
Total runtime 42398 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_30a
(NrP: 231 NrTr: 173 NrArc: 839)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec

net check time: 0m 0.000sec

init dd package: 0m 2.768sec


RS generation: 10m27.154sec


-> reachability set: #nodes 1198093 (1.2e+06) #states 9,614,416,128,980 (12)



starting MCC model checker
--------------------------

checking: place_bound(p95)
normalized: place_bound(p95)

-> the formula is 1

FORMULA DES-PT-30a-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: place_bound(p14)
normalized: place_bound(p14)

-> the formula is 1

FORMULA DES-PT-30a-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p41)
normalized: place_bound(p41)

-> the formula is 1

FORMULA DES-PT-30a-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 59752076 (6.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 277525783 1683358715 1960884498
used/not used/entry size/cache size: 67108860 4 16 1024MB
basic ops cache: hits/miss/sum: 2232268 11686875 13919143
used/not used/entry size/cache size: 9170794 7606422 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 205392 1198827 1404219
used/not used/entry size/cache size: 1118679 7269929 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 27962033
1 24044526
2 10794126
3 3332532
4 791299
5 154640
6 25325
7 3799
8 502
9 73
>= 10 9

Total processing time: 10m37.641sec


BK_STOP 1678394656008

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

1238373 1290803 1186145 1299922 1454062 1500130 1178559
iterations count:748943 (4329), effective:59867 (346)

initing FirstDep: 0m 0.000sec

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-30a"
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-30a, 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-167814482700445"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;