About the Execution of 2021-gold for DoubleLock-PT-p3s1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16228.571 | 3600000.00 | 3635386.00 | 22001.40 | 1 ? 1 1 ? 10 10 1 1 0 ? 1 ? 10 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/mcc2022-input.r323-tall-165472292700127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DoubleLock-PT-p3s1, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292700127
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.6K Jun 7 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 7 16:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Jun 7 16:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 16:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Jun 7 16:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 16:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Jun 7 16:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 5 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 39K Jun 6 12:11 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 DoubleLock-PT-p3s1-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p3s1-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654750149830
Running Version 0
[2022-06-09 04:49:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 04:49:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 04:49:11] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2022-06-09 04:49:11] [INFO ] Transformed 46 places.
[2022-06-09 04:49:11] [INFO ] Transformed 80 transitions.
[2022-06-09 04:49:11] [INFO ] Parsed PT model containing 46 places and 80 transitions in 73 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA DoubleLock-PT-p3s1-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 61 out of 76 initially.
// Phase 1: matrix 61 rows 40 cols
[2022-06-09 04:49:11] [INFO ] Computed 4 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 63 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 15) seen :63
FORMULA DoubleLock-PT-p3s1-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s1-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 5) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :70
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :31
FORMULA DoubleLock-PT-p3s1-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :27
[2022-06-09 04:49:11] [INFO ] Flow matrix only has 61 transitions (discarded 15 similar events)
// Phase 1: matrix 61 rows 40 cols
[2022-06-09 04:49:11] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 04:49:11] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-06-09 04:49:11] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 04:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:11] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-06-09 04:49:11] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:49:11] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2022-06-09 04:49:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:49:11] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-09 04:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:11] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 04:49:11] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:11] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 7 ms.
[2022-06-09 04:49:11] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 3 ms to minimize.
[2022-06-09 04:49:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2022-06-09 04:49:11] [INFO ] Added : 22 causal constraints over 5 iterations in 122 ms. Result :sat
Minimization took 10 ms.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 10 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2022-06-09 04:49:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2022-06-09 04:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-06-09 04:49:12] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 8 ms.
[2022-06-09 04:49:12] [INFO ] Added : 24 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 7 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:12] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-06-09 04:49:12] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2022-06-09 04:49:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2022-06-09 04:49:12] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:12] [INFO ] Added : 25 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:12] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:12] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:12] [INFO ] Computed and/alt/rep : 30/128/30 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:12] [INFO ] Added : 25 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[16, 40, 12, 13]
Incomplete Parikh walk after 8200 steps, including 473 resets, run finished after 13 ms. (steps per millisecond=630 ) properties (out of 4) seen :24 could not realise parikh vector
Incomplete Parikh walk after 8600 steps, including 563 resets, run finished after 13 ms. (steps per millisecond=661 ) properties (out of 4) seen :23 could not realise parikh vector
Incomplete Parikh walk after 33000 steps, including 834 resets, run finished after 58 ms. (steps per millisecond=568 ) properties (out of 4) seen :22 could not realise parikh vector
Incomplete Parikh walk after 19700 steps, including 990 resets, run finished after 33 ms. (steps per millisecond=596 ) properties (out of 4) seen :42 could not realise parikh vector
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 76/76 transitions.
Graph (complete) has 153 edges and 40 vertex of which 37 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 37 transition count 75
Applied a total of 2 rules in 22 ms. Remains 37 /40 variables (removed 3) and now considering 75/76 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/40 places, 75/76 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:12] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1327 ms. (steps per millisecond=753 ) properties (out of 4) seen :46
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 4) seen :4419
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=2583 ) properties (out of 4) seen :3927
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 4) seen :31
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 4) seen :36
[2022-06-09 04:49:15] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:15] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:49:15] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:49:15] [INFO ] [Real]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 04:49:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:15] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-06-09 04:49:15] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-06-09 04:49:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2022-06-09 04:49:15] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:15] [INFO ] Added : 24 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:15] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-06-09 04:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-06-09 04:49:15] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:15] [INFO ] Added : 24 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:49:15] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:16] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:16] [INFO ] Added : 25 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:49:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:16] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2022-06-09 04:49:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:16] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:16] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:16] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:49:16] [INFO ] Added : 25 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4395, 3899, 14, 17]
Incomplete Parikh walk after 9400 steps, including 648 resets, run finished after 12 ms. (steps per millisecond=783 ) properties (out of 4) seen :12 could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 612 resets, run finished after 13 ms. (steps per millisecond=707 ) properties (out of 4) seen :17 could not realise parikh vector
Incomplete Parikh walk after 2736700 steps, including 1000 resets, run finished after 2487 ms. (steps per millisecond=1100 ) properties (out of 4) seen :162015 could not realise parikh vector
Incomplete Parikh walk after 3519600 steps, including 1000 resets, run finished after 2753 ms. (steps per millisecond=1278 ) properties (out of 4) seen :485512 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 4 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:49:21] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:21] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 04:49:21] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 04:49:21] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:49:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:49:21] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2022-06-09 04:49:21] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:49:21] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:49:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:21] [INFO ] Computed 3 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1240 ms. (steps per millisecond=806 ) properties (out of 4) seen :54
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=2849 ) properties (out of 4) seen :4376
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 4) seen :3963
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 4) seen :30
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 4) seen :35
[2022-06-09 04:49:24] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:24] [INFO ] Computed 3 place invariants in 4 ms
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:49:24] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:49:24] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2022-06-09 04:49:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2022-06-09 04:49:24] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2022-06-09 04:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2022-06-09 04:49:24] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 7 ms.
[2022-06-09 04:49:24] [INFO ] Added : 24 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2022-06-09 04:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-06-09 04:49:24] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 8 ms.
[2022-06-09 04:49:24] [INFO ] Added : 24 causal constraints over 5 iterations in 42 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:49:24] [INFO ] Added : 25 causal constraints over 5 iterations in 49 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:49:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:49:24] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 04:49:24] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:49:24] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:49:24] [INFO ] Added : 25 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4395, 484269, 1916, 700]
Incomplete Parikh walk after 282600 steps, including 1000 resets, run finished after 236 ms. (steps per millisecond=1197 ) properties (out of 4) seen :35980 could not realise parikh vector
Incomplete Parikh walk after 960200 steps, including 1000 resets, run finished after 795 ms. (steps per millisecond=1207 ) properties (out of 4) seen :132707 could not realise parikh vector
Interrupted Parikh walk after 39430189 steps, including 980 resets, run timeout after 30001 ms. (steps per millisecond=1314 ) properties (out of 4) seen :208101
Incomplete Parikh walk after 3519600 steps, including 1000 resets, run finished after 2655 ms. (steps per millisecond=1325 ) properties (out of 4) seen :487075 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:49:58] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:49:58] [INFO ] Implicit Places using invariants in 37 ms returned []
[2022-06-09 04:49:58] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:58] [INFO ] Computed 3 place invariants in 3 ms
[2022-06-09 04:49:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:49:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2022-06-09 04:49:58] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:49:58] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:49:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:49:58] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 4) seen :52
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 4) seen :4417
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 4) seen :3920
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 4) seen :36
[2022-06-09 04:50:01] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:50:01] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 04:50:01] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:50:01] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2022-06-09 04:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 4 ms returned sat
[2022-06-09 04:50:01] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2022-06-09 04:50:01] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-06-09 04:50:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2022-06-09 04:50:01] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:50:01] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:50:01] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2022-06-09 04:50:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-06-09 04:50:01] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 6 ms.
[2022-06-09 04:50:01] [INFO ] Added : 24 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:50:01] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:50:01] [INFO ] Added : 25 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:50:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:50:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:50:01] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:50:01] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:50:01] [INFO ] Added : 25 causal constraints over 5 iterations in 38 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4395, 485939, 206979, 1104]
Incomplete Parikh walk after 444200 steps, including 1000 resets, run finished after 375 ms. (steps per millisecond=1184 ) properties (out of 4) seen :59442 could not realise parikh vector
Interrupted Parikh walk after 38880523 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1295 ) properties (out of 4) seen :5550209
Interrupted Parikh walk after 39729998 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1324 ) properties (out of 4) seen :844523
Incomplete Parikh walk after 3519600 steps, including 1000 resets, run finished after 2585 ms. (steps per millisecond=1361 ) properties (out of 4) seen :488342 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:51:04] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:04] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:51:04] [INFO ] Implicit Places using invariants in 46 ms returned []
[2022-06-09 04:51:04] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:04] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:51:04] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:51:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-09 04:51:05] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:51:05] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:51:05] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:05] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1158 ms. (steps per millisecond=863 ) properties (out of 4) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 343 ms. (steps per millisecond=2915 ) properties (out of 4) seen :4500
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 340 ms. (steps per millisecond=2941 ) properties (out of 4) seen :3720
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 4) seen :35
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 4) seen :32
[2022-06-09 04:51:07] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:07] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:51:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:51:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:51:07] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:07] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:07] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2022-06-09 04:51:07] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-09 04:51:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2022-06-09 04:51:07] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:51:07] [INFO ] Added : 24 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:51:07] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:07] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:07] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-09 04:51:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-06-09 04:51:07] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:51:07] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 14 ms.
[2022-06-09 04:51:07] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:08] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:51:08] [INFO ] Added : 25 causal constraints over 5 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2022-06-09 04:51:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:08] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:08] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:51:08] [INFO ] Added : 25 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4482, 5550178, 232690, 1709]
Incomplete Parikh walk after 686200 steps, including 1000 resets, run finished after 561 ms. (steps per millisecond=1223 ) properties (out of 4) seen :94139 could not realise parikh vector
Interrupted Parikh walk after 38209637 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1273 ) properties (out of 4) seen :5454150
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=0 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3589200 steps, including 1000 resets, run finished after 2671 ms. (steps per millisecond=1343 ) properties (out of 4) seen :490223 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:51:41] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:51:41] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-06-09 04:51:41] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:51:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:51:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-06-09 04:51:41] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:51:41] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:41] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:51:41] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:41] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1150 ms. (steps per millisecond=869 ) properties (out of 4) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 339 ms. (steps per millisecond=2949 ) properties (out of 4) seen :4346
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 4) seen :4284
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 4) seen :37
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 4) seen :33
[2022-06-09 04:51:44] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:51:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:51:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:51:44] [INFO ] [Real]Added 21 Read/Feed constraints in 8 ms returned sat
[2022-06-09 04:51:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:44] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2022-06-09 04:51:44] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-06-09 04:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2022-06-09 04:51:44] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:51:44] [INFO ] Added : 24 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 10 ms.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Added 21 Read/Feed constraints in 15 ms returned sat
[2022-06-09 04:51:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:51:44] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2022-06-09 04:51:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-06-09 04:51:44] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:51:44] [INFO ] Added : 24 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 10 ms.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:44] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:51:44] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 17 ms.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:51:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:51:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:51:44] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:51:44] [INFO ] Added : 25 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4482, 5550178, 232690, 1709]
Incomplete Parikh walk after 686200 steps, including 1000 resets, run finished after 537 ms. (steps per millisecond=1277 ) properties (out of 4) seen :93654 could not realise parikh vector
Interrupted Parikh walk after 39216969 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1307 ) properties (out of 4) seen :5597960
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3589200 steps, including 1000 resets, run finished after 2649 ms. (steps per millisecond=1354 ) properties (out of 4) seen :497970 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 12 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 8 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:52:17] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:52:17] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-06-09 04:52:17] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:17] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:52:17] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:52:17] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-06-09 04:52:17] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 04:52:17] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:17] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:52:17] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:17] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1139 ms. (steps per millisecond=877 ) properties (out of 4) seen :53
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 4) seen :4522
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 4) seen :3902
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 365 ms. (steps per millisecond=2739 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 363 ms. (steps per millisecond=2754 ) properties (out of 4) seen :37
[2022-06-09 04:52:20] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:20] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:20] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:52:20] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-06-09 04:52:20] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2022-06-09 04:52:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 50 ms
[2022-06-09 04:52:20] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:52:20] [INFO ] Added : 24 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2022-06-09 04:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-06-09 04:52:20] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:52:20] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:52:20] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:52:20] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:21] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:52:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:52:21] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:52:21] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4494, 5597933, 232690, 1709]
Incomplete Parikh walk after 686200 steps, including 1000 resets, run finished after 532 ms. (steps per millisecond=1289 ) properties (out of 4) seen :94005 could not realise parikh vector
Interrupted Parikh walk after 39235561 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1307 ) properties (out of 4) seen :5600844
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3598800 steps, including 1000 resets, run finished after 2641 ms. (steps per millisecond=1362 ) properties (out of 4) seen :491043 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:52:54] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:52:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2022-06-09 04:52:54] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:52:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:52:54] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2022-06-09 04:52:54] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:52:54] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:52:54] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:54] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1153 ms. (steps per millisecond=867 ) properties (out of 4) seen :48
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 4) seen :4338
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=3048 ) properties (out of 4) seen :4568
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 4) seen :31
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 4) seen :32
[2022-06-09 04:52:56] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:52:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:52:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:56] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:52:56] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2022-06-09 04:52:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:52:56] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-06-09 04:52:57] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2022-06-09 04:52:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-06-09 04:52:57] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:52:57] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-06-09 04:52:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-06-09 04:52:57] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 7 ms.
[2022-06-09 04:52:57] [INFO ] Added : 24 causal constraints over 5 iterations in 39 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:52:57] [INFO ] Added : 25 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 12 ms.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:52:57] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:52:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:52:57] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:52:57] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1] Max seen :[4494, 5600803, 232690, 1709]
Incomplete Parikh walk after 686200 steps, including 1000 resets, run finished after 550 ms. (steps per millisecond=1247 ) properties (out of 4) seen :93583 could not realise parikh vector
Interrupted Parikh walk after 38391181 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1279 ) properties (out of 4) seen :5479676
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 3598800 steps, including 1000 resets, run finished after 2662 ms. (steps per millisecond=1351 ) properties (out of 4) seen :493011 could not realise parikh vector
Support contains 4 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:53:30] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:30] [INFO ] Computed 3 place invariants in 9 ms
[2022-06-09 04:53:30] [INFO ] Implicit Places using invariants in 31 ms returned []
[2022-06-09 04:53:30] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:30] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2022-06-09 04:53:30] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 04:53:30] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:30] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting property specific reduction for DoubleLock-PT-p3s1-UpperBounds-01
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:30] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :40
[2022-06-09 04:53:30] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:30] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:30] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-06-09 04:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:53:30] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:30] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:30] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:53:30] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:53:30] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2022-06-09 04:53:30] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-06-09 04:53:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2022-06-09 04:53:30] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:30] [INFO ] Added : 24 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[40]
Incomplete Parikh walk after 35600 steps, including 892 resets, run finished after 39 ms. (steps per millisecond=912 ) properties (out of 1) seen :28 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:31] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :4419
[2022-06-09 04:53:32] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:32] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:32] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:53:32] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:32] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:32] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:53:32] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:32] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-09 04:53:32] [INFO ] Deduced a trap composed of 6 places in 13 ms of which 0 ms to minimize.
[2022-06-09 04:53:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2022-06-09 04:53:32] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:32] [INFO ] Added : 24 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4419]
Incomplete Parikh walk after 3538800 steps, including 1000 resets, run finished after 2607 ms. (steps per millisecond=1357 ) properties (out of 1) seen :1804 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:53:35] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:35] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-06-09 04:53:35] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:35] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:35] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-06-09 04:53:35] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:53:35] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:35] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1184 ms. (steps per millisecond=844 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=2890 ) properties (out of 1) seen :4423
[2022-06-09 04:53:36] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:36] [INFO ] Computed 3 place invariants in 6 ms
[2022-06-09 04:53:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:36] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-06-09 04:53:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:36] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:36] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:53:36] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:36] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-06-09 04:53:36] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2022-06-09 04:53:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 39 ms
[2022-06-09 04:53:36] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:37] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4423]
Incomplete Parikh walk after 3542000 steps, including 1000 resets, run finished after 2716 ms. (steps per millisecond=1304 ) properties (out of 1) seen :686 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:53:39] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 04:53:39] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:39] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:39] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:39] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-06-09 04:53:39] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:53:39] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:39] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:39] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1120 ms. (steps per millisecond=892 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :4304
[2022-06-09 04:53:41] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:41] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:53:41] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:41] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:53:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:41] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:53:41] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:41] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2022-06-09 04:53:41] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2022-06-09 04:53:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-06-09 04:53:41] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:41] [INFO ] Added : 24 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4423]
Incomplete Parikh walk after 3542000 steps, including 1000 resets, run finished after 2531 ms. (steps per millisecond=1399 ) properties (out of 1) seen :914 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:53:44] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:44] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 04:53:44] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:44] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-06-09 04:53:44] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:53:44] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Ending property specific reduction for DoubleLock-PT-p3s1-UpperBounds-01 in 13341 ms.
Starting property specific reduction for DoubleLock-PT-p3s1-UpperBounds-04
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :33
[2022-06-09 04:53:44] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:44] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:44] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:53:44] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:44] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:44] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:53:44] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:53:44] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2022-06-09 04:53:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-06-09 04:53:44] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:44] [INFO ] Added : 24 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[33]
Incomplete Parikh walk after 30500 steps, including 1000 resets, run finished after 33 ms. (steps per millisecond=924 ) properties (out of 1) seen :292 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:44] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1179 ms. (steps per millisecond=848 ) properties (out of 1) seen :13
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 332 ms. (steps per millisecond=3012 ) properties (out of 1) seen :3658
[2022-06-09 04:53:45] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:45] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 04:53:45] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:45] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:45] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:53:45] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:45] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 5 ms to minimize.
[2022-06-09 04:53:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-06-09 04:53:45] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 5 ms.
[2022-06-09 04:53:45] [INFO ] Added : 24 causal constraints over 5 iterations in 33 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3658]
Incomplete Parikh walk after 2568000 steps, including 1000 resets, run finished after 2077 ms. (steps per millisecond=1236 ) properties (out of 1) seen :143163 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:53:48] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2022-06-09 04:53:48] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:48] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:48] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:48] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-06-09 04:53:48] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:53:48] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:48] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:53:48] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:48] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1173 ms. (steps per millisecond=852 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 334 ms. (steps per millisecond=2994 ) properties (out of 1) seen :3886
[2022-06-09 04:53:49] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:53:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:53:49] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:53:49] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:53:49] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:53:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:53:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:53:49] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:53:49] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:53:49] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2022-06-09 04:53:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-06-09 04:53:49] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:53:49] [INFO ] Added : 24 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[143163]
Interrupted Parikh walk after 39268108 steps, including 1000 resets, run timeout after 30001 ms. (steps per millisecond=1308 ) properties (out of 1) seen :1654654
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:54:19] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:19] [INFO ] Computed 3 place invariants in 10 ms
[2022-06-09 04:54:19] [INFO ] Implicit Places using invariants in 40 ms returned []
[2022-06-09 04:54:19] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:19] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2022-06-09 04:54:19] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 04:54:19] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:20] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:20] [INFO ] Computed 3 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :4285
[2022-06-09 04:54:21] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:21] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:21] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:54:21] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:21] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:54:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:21] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:54:21] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:21] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2022-06-09 04:54:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-06-09 04:54:21] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:54:21] [INFO ] Added : 24 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1654654]
Interrupted Parikh walk after 45845841 steps, including 638 resets, run timeout after 30001 ms. (steps per millisecond=1528 ) properties (out of 1) seen :7
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:54:51] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:51] [INFO ] Implicit Places using invariants in 35 ms returned []
[2022-06-09 04:54:51] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:51] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-06-09 04:54:51] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 04:54:51] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:51] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Ending property specific reduction for DoubleLock-PT-p3s1-UpperBounds-04 in 67589 ms.
Starting property specific reduction for DoubleLock-PT-p3s1-UpperBounds-10
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :15
[2022-06-09 04:54:51] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:51] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 04:54:51] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:51] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:54:51] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:54:51] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:54:51] [INFO ] Added : 25 causal constraints over 5 iterations in 35 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[16]
Incomplete Parikh walk after 10200 steps, including 672 resets, run finished after 10 ms. (steps per millisecond=1020 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:51] [INFO ] Computed 3 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 1) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :12
[2022-06-09 04:54:53] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 11 ms
[2022-06-09 04:54:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:54:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:53] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 04:54:53] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:54:53] [INFO ] Added : 25 causal constraints over 5 iterations in 29 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[16]
Incomplete Parikh walk after 10200 steps, including 678 resets, run finished after 12 ms. (steps per millisecond=850 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:54:53] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:53] [INFO ] Implicit Places using invariants in 38 ms returned []
[2022-06-09 04:54:53] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2022-06-09 04:54:53] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 04:54:53] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:53] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Ending property specific reduction for DoubleLock-PT-p3s1-UpperBounds-10 in 1864 ms.
Starting property specific reduction for DoubleLock-PT-p3s1-UpperBounds-12
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :14
[2022-06-09 04:54:53] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:53] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:53] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-06-09 04:54:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:53] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:53] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:54:53] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:53] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 3 ms.
[2022-06-09 04:54:53] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[14]
Incomplete Parikh walk after 8200 steps, including 563 resets, run finished after 11 ms. (steps per millisecond=745 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:53] [INFO ] Computed 3 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1086 ms. (steps per millisecond=920 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 1) seen :15
[2022-06-09 04:54:55] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:54:55] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:55] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 04:54:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:55] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 04:54:55] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:55] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 4 ms.
[2022-06-09 04:54:55] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Incomplete Parikh walk after 8600 steps, including 579 resets, run finished after 11 ms. (steps per millisecond=781 ) properties (out of 1) seen :8 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:54:55] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:55] [INFO ] Computed 3 place invariants in 2 ms
[2022-06-09 04:54:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2022-06-09 04:54:55] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:55] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-06-09 04:54:55] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 04:54:55] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:55] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:55] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Normalized transition count is 60 out of 75 initially.
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:55] [INFO ] Computed 3 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 1) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 1) seen :13
[2022-06-09 04:54:56] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:56] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-09 04:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:56] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-06-09 04:54:56] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:56] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 04:54:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-09 04:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 04:54:56] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-06-09 04:54:56] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2022-06-09 04:54:56] [INFO ] Computed and/alt/rep : 29/126/29 causal constraints (skipped 29 transitions) in 2 ms.
[2022-06-09 04:54:56] [INFO ] Added : 25 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Incomplete Parikh walk after 8600 steps, including 587 resets, run finished after 9 ms. (steps per millisecond=955 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 75/75 transitions.
Applied a total of 0 rules in 2 ms. Remains 37 /37 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2022-06-09 04:54:56] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:56] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:57] [INFO ] Implicit Places using invariants in 27 ms returned []
[2022-06-09 04:54:57] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:57] [INFO ] Computed 3 place invariants in 0 ms
[2022-06-09 04:54:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 04:54:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-06-09 04:54:57] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 04:54:57] [INFO ] Flow matrix only has 60 transitions (discarded 15 similar events)
// Phase 1: matrix 60 rows 37 cols
[2022-06-09 04:54:57] [INFO ] Computed 3 place invariants in 1 ms
[2022-06-09 04:54:57] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 75/75 transitions.
Ending property specific reduction for DoubleLock-PT-p3s1-UpperBounds-12 in 3511 ms.
[2022-06-09 04:54:57] [INFO ] Flatten gal took : 41 ms
[2022-06-09 04:54:57] [INFO ] Applying decomposition
[2022-06-09 04:54:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11141404661862306934.txt, -o, /tmp/graph11141404661862306934.bin, -w, /tmp/graph11141404661862306934.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11141404661862306934.bin, -l, -1, -v, -w, /tmp/graph11141404661862306934.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 04:54:57] [INFO ] Decomposing Gal with order
[2022-06-09 04:54:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 04:54:57] [INFO ] Removed a total of 124 redundant transitions.
[2022-06-09 04:54:57] [INFO ] Flatten gal took : 32 ms
[2022-06-09 04:54:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2022-06-09 04:54:57] [INFO ] Time to serialize gal into /tmp/UpperBounds11676738067812744351.gal : 3 ms
[2022-06-09 04:54:57] [INFO ] Time to serialize properties into /tmp/UpperBounds5261749677223722287.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11676738067812744351.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5261749677223722287.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11676738067812744351.gal -t CGAL -reachable-file /tmp/UpperBounds5261749677223722287.prop --nowitness
Loading property file /tmp/UpperBounds5261749677223722287.prop.
Detected timeout of ITS tools.
[2022-06-09 05:16:53] [INFO ] Flatten gal took : 7 ms
[2022-06-09 05:16:53] [INFO ] Time to serialize gal into /tmp/UpperBounds2100564934366372838.gal : 4 ms
[2022-06-09 05:16:53] [INFO ] Time to serialize properties into /tmp/UpperBounds14066241220495447822.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2100564934366372838.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14066241220495447822.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds2100564934366372838.gal -t CGAL -reachable-file /tmp/UpperBounds14066241220495447822.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds14066241220495447822.prop.
Detected timeout of ITS tools.
[2022-06-09 05:38:49] [INFO ] Flatten gal took : 172 ms
[2022-06-09 05:38:49] [INFO ] Input system was already deterministic with 75 transitions.
[2022-06-09 05:38:49] [INFO ] Transformed 37 places.
[2022-06-09 05:38:49] [INFO ] Transformed 75 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-09 05:38:49] [INFO ] Time to serialize gal into /tmp/UpperBounds18435087416522473632.gal : 16 ms
[2022-06-09 05:38:49] [INFO ] Time to serialize properties into /tmp/UpperBounds400180019202617167.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18435087416522473632.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds400180019202617167.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18435087416522473632.gal -t CGAL -reachable-file /tmp/UpperBounds400180019202617167.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds400180019202617167.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DoubleLock-PT-p3s1"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DoubleLock-PT-p3s1, 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 r323-tall-165472292700127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s1.tgz
mv DoubleLock-PT-p3s1 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 ;