About the Execution of 2022-gold for LamportFastMutEx-COL-6
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16216.268 | 3600000.00 | 3006015.00 | 380440.00 | 6 1 ? 6 30 6 5 5 6 5 1 6 6 5 5 5 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300047.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is LamportFastMutEx-COL-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300047
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.1K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 13:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 13:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 42K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-6-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678750048351
Running Version 202205111006
[2023-03-13 23:27:29] [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]
[2023-03-13 23:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:27:29] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-13 23:27:30] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 23:27:30] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 721 ms
[2023-03-13 23:27:30] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 217 PT places and 525.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
[2023-03-13 23:27:30] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-13 23:27:30] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:27:30] [INFO ] Computed 2 place invariants in 8 ms
FORMULA LamportFastMutEx-COL-6-UpperBounds-12 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-6-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
// Phase 1: matrix 17 rows 15 cols
[2023-03-13 23:27:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 23:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 23:27:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 23:27:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:27:30] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:27:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:27:30] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:30] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 23:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:27:30] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:30] [INFO ] Added : 11 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 10 ms.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:27:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:27:31] [INFO ] Added : 11 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:31] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:31] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 23:27:31] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:31] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 23:27:31] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 23:27:31] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 23:27:31] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 23:27:31] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6, 36, 6, 6, 6, 6, 6, 6, 6, 6]
Domain [pid(7), pid(7)] of place P_wait breaks symmetries in sort pid
Symmetric sort wr.t. initial and guards and successors and join/free detected :P_bool
Arc [3:1*[$i, 1]] contains constants of sort P_bool
Transition T_setbi_2 : constants on arcs in [[3:1*[$i, 1]]] introduces in P_bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-13 23:27:31] [INFO ] Unfolded HLPN to a Petri net with 217 places and 420 transitions 1834 arcs in 36 ms.
[2023-03-13 23:27:31] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 41 places in 4 ms
Reduce places removed 41 places and 66 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :66
FORMULA LamportFastMutEx-COL-6-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :51
FORMULA LamportFastMutEx-COL-6-UpperBounds-00 6 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 10) seen :46
FORMULA LamportFastMutEx-COL-6-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :39
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :52
[2023-03-13 23:27:31] [INFO ] Flow matrix only has 264 transitions (discarded 90 similar events)
// Phase 1: matrix 264 rows 176 cols
[2023-03-13 23:27:31] [INFO ] Computed 50 place invariants in 7 ms
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-13 23:27:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2023-03-13 23:27:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:31] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 23:27:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 23:27:31] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 5 ms to minimize.
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-13 23:27:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 147 ms
[2023-03-13 23:27:32] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 20 ms.
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:27:32] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2023-03-13 23:27:33] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1042 ms
[2023-03-13 23:27:33] [INFO ] Added : 116 causal constraints over 25 iterations in 1637 ms. Result :sat
Minimization took 176 ms.
[2023-03-13 23:27:34] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2023-03-13 23:27:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:34] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-13 23:27:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 11 ms returned sat
[2023-03-13 23:27:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:34] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 23:27:34] [INFO ] [Nat]Added 72 Read/Feed constraints in 33 ms returned sat
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:27:34] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 886 ms
[2023-03-13 23:27:35] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:35] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:35] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:27:35] [INFO ] [Nat]Added 72 Read/Feed constraints in 32 ms returned sat
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 4 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:27:35] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 884 ms
[2023-03-13 23:27:36] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:36] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 12 ms returned sat
[2023-03-13 23:27:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:36] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 23:27:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 496 ms
[2023-03-13 23:27:36] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 18 ms.
[2023-03-13 23:27:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-13 23:27:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-13 23:27:37] [INFO ] Added : 93 causal constraints over 20 iterations in 501 ms. Result :sat
Minimization took 129 ms.
[2023-03-13 23:27:37] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:37] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-13 23:27:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:37] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:37] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:27:37] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-13 23:27:37] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:27:37] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-13 23:27:37] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 36 places in 35 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 630 ms
[2023-03-13 23:27:38] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:38] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-13 23:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:38] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:38] [INFO ] [Nat]Added 72 Read/Feed constraints in 8 ms returned sat
[2023-03-13 23:27:38] [INFO ] Computed and/alt/rep : 234/1218/234 causal constraints (skipped 24 transitions) in 19 ms.
[2023-03-13 23:27:38] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2023-03-13 23:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 99 ms
[2023-03-13 23:27:39] [INFO ] Added : 88 causal constraints over 18 iterations in 464 ms. Result :sat
Minimization took 119 ms.
[2023-03-13 23:27:39] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:39] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-13 23:27:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:39] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-13 23:27:39] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-13 23:27:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 608 ms
[2023-03-13 23:27:40] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:40] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-13 23:27:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:40] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-13 23:27:40] [INFO ] [Nat]Added 72 Read/Feed constraints in 12 ms returned sat
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-13 23:27:40] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 943 ms
[2023-03-13 23:27:41] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-13 23:27:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:41] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-13 23:27:41] [INFO ] [Nat]Added 72 Read/Feed constraints in 14 ms returned sat
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2023-03-13 23:27:41] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2023-03-13 23:27:42] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:42] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2023-03-13 23:27:42] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:42] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2023-03-13 23:27:42] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 904 ms
Current structural bounds on expressions (after SMT) : [6, 30, 5, 6, 5, 6, 5, 5, 5] Max seen :[1, 30, 5, 4, 5, 4, 5, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-15 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-6-UpperBounds-04 30 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 18 out of 176 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 176/176 places, 354/354 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 170 transition count 348
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 18 place count 170 transition count 342
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 164 transition count 342
Applied a total of 24 rules in 54 ms. Remains 164 /176 variables (removed 12) and now considering 342/354 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/176 places, 342/354 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2023-03-13 23:27:42] [INFO ] Computed 50 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2196 ms. (steps per millisecond=455 ) properties (out of 3) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=1538 ) properties (out of 3) seen :9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 3) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 606 ms. (steps per millisecond=1650 ) properties (out of 3) seen :3
[2023-03-13 23:27:46] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-13 23:27:46] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-13 23:27:46] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-13 23:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:46] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:47] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 23:27:47] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:27:47] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 0 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 0 ms to minimize.
[2023-03-13 23:27:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2023-03-13 23:27:47] [INFO ] Added : 63 causal constraints over 13 iterations in 801 ms. Result :sat
Minimization took 126 ms.
[2023-03-13 23:27:48] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:48] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:27:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:48] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:27:48] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2023-03-13 23:27:48] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:27:49] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:49] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 0 ms to minimize.
[2023-03-13 23:27:49] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 0 ms to minimize.
[2023-03-13 23:27:49] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1000 ms
[2023-03-13 23:27:49] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-13 23:27:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:49] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:49] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:27:49] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 20 ms.
[2023-03-13 23:27:49] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-13 23:27:49] [INFO ] Added : 97 causal constraints over 21 iterations in 505 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [6, 5, 6] Max seen :[1, 5, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-07 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 14 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 164 cols
[2023-03-13 23:27:50] [INFO ] Computed 50 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 2) seen :2
[2023-03-13 23:27:53] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-13 23:27:53] [INFO ] Computed 50 place invariants in 4 ms
[2023-03-13 23:27:53] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2023-03-13 23:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-13 23:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:53] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2023-03-13 23:27:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2023-03-13 23:27:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 9 ms returned sat
[2023-03-13 23:27:53] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 19 ms.
[2023-03-13 23:27:53] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:27:53] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:27:54] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-13 23:27:54] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-13 23:27:54] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:27:54] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:54] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 517 ms
[2023-03-13 23:27:54] [INFO ] Added : 63 causal constraints over 13 iterations in 790 ms. Result :sat
Minimization took 124 ms.
[2023-03-13 23:27:54] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2023-03-13 23:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:54] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:27:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:54] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2023-03-13 23:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:54] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-13 23:27:54] [INFO ] [Nat]Added 72 Read/Feed constraints in 11 ms returned sat
[2023-03-13 23:27:54] [INFO ] Computed and/alt/rep : 216/1194/216 causal constraints (skipped 30 transitions) in 18 ms.
[2023-03-13 23:27:55] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2023-03-13 23:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2023-03-13 23:27:55] [INFO ] Added : 97 causal constraints over 21 iterations in 496 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 5]
Support contains 12 out of 164 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 30 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 164/164 places, 342/342 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 164/164 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 164 /164 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-13 23:27:55] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 164 cols
[2023-03-13 23:27:55] [INFO ] Computed 50 place invariants in 2 ms
[2023-03-13 23:27:55] [INFO ] Implicit Places using invariants in 142 ms returned [104, 105, 106, 107, 108, 109]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 145 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 158/164 places, 342/342 transitions.
Applied a total of 0 rules in 11 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 158/164 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:27:55] [INFO ] Computed 44 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 614 ms. (steps per millisecond=1628 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 2) seen :2
[2023-03-13 23:27:58] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:27:58] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-13 23:27:58] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-13 23:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:58] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-13 23:27:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:58] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-13 23:27:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:58] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-13 23:27:58] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:27:58] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:27:58] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-13 23:27:59] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2023-03-13 23:27:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-13 23:27:59] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-13 23:27:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
[2023-03-13 23:27:59] [INFO ] Added : 65 causal constraints over 14 iterations in 498 ms. Result :sat
Minimization took 108 ms.
[2023-03-13 23:27:59] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2023-03-13 23:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:59] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-13 23:27:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:27:59] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-13 23:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:27:59] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-13 23:27:59] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:27:59] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-13 23:27:59] [INFO ] Added : 54 causal constraints over 11 iterations in 217 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [6, 6] Max seen :[1, 5]
FORMULA LamportFastMutEx-COL-6-UpperBounds-11 6 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 9 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:00] [INFO ] Computed 44 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :1
[2023-03-13 23:28:02] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:02] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-13 23:28:02] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-13 23:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:02] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-13 23:28:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:28:02] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-13 23:28:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:02] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 23:28:02] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:28:02] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:28:02] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 15 ms.
[2023-03-13 23:28:03] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2023-03-13 23:28:03] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2023-03-13 23:28:03] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-13 23:28:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 222 ms
[2023-03-13 23:28:03] [INFO ] Added : 65 causal constraints over 14 iterations in 475 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 17 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 10 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-13 23:28:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:03] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-13 23:28:03] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-13 23:28:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:03] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-13 23:28:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:28:03] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2023-03-13 23:28:03] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-13 23:28:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:03] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-13 23:28:03] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:03] [INFO ] Computed 44 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-13 23:28:03] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:03] [INFO ] Computed 44 place invariants in 4 ms
[2023-03-13 23:28:04] [INFO ] [Real]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-13 23:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:04] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-13 23:28:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:28:04] [INFO ] [Nat]Absence check using 44 positive place invariants in 6 ms returned sat
[2023-03-13 23:28:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:04] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-13 23:28:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:28:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-13 23:28:04] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 17 ms.
[2023-03-13 23:28:04] [INFO ] Deduced a trap composed of 26 places in 78 ms of which 0 ms to minimize.
[2023-03-13 23:28:04] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2023-03-13 23:28:04] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-13 23:28:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 234 ms
[2023-03-13 23:28:04] [INFO ] Added : 65 causal constraints over 14 iterations in 490 ms. Result :sat
Minimization took 109 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Normalized transition count is 252 out of 342 initially.
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:04] [INFO ] Computed 44 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :1
[2023-03-13 23:28:07] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:07] [INFO ] Computed 44 place invariants in 7 ms
[2023-03-13 23:28:07] [INFO ] [Real]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-13 23:28:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:07] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-13 23:28:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:28:07] [INFO ] [Nat]Absence check using 44 positive place invariants in 7 ms returned sat
[2023-03-13 23:28:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:28:07] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-13 23:28:07] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:28:07] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-13 23:28:07] [INFO ] Computed and/alt/rep : 216/1122/216 causal constraints (skipped 30 transitions) in 16 ms.
[2023-03-13 23:28:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2023-03-13 23:28:07] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 0 ms to minimize.
[2023-03-13 23:28:07] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-13 23:28:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 236 ms
[2023-03-13 23:28:07] [INFO ] Added : 65 causal constraints over 14 iterations in 502 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : [6] Max seen :[1]
Support contains 6 out of 158 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 158/158 places, 342/342 transitions.
Applied a total of 0 rules in 5 ms. Remains 158 /158 variables (removed 0) and now considering 342/342 (removed 0) transitions.
[2023-03-13 23:28:08] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:08] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-13 23:28:08] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-13 23:28:08] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:08] [INFO ] Computed 44 place invariants in 1 ms
[2023-03-13 23:28:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-13 23:28:08] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-13 23:28:08] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-13 23:28:08] [INFO ] Flow matrix only has 252 transitions (discarded 90 similar events)
// Phase 1: matrix 252 rows 158 cols
[2023-03-13 23:28:08] [INFO ] Computed 44 place invariants in 2 ms
[2023-03-13 23:28:08] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 158/158 places, 342/342 transitions.
Ending property specific reduction for LamportFastMutEx-COL-6-UpperBounds-02 in 4712 ms.
[2023-03-13 23:28:08] [INFO ] Flatten gal took : 59 ms
[2023-03-13 23:28:08] [INFO ] Applying decomposition
[2023-03-13 23:28:08] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1740948629234326100.txt' '-o' '/tmp/graph1740948629234326100.bin' '-w' '/tmp/graph1740948629234326100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1740948629234326100.bin' '-l' '-1' '-v' '-w' '/tmp/graph1740948629234326100.weights' '-q' '0' '-e' '0.001'
[2023-03-13 23:28:08] [INFO ] Decomposing Gal with order
[2023-03-13 23:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:28:09] [INFO ] Removed a total of 483 redundant transitions.
[2023-03-13 23:28:09] [INFO ] Flatten gal took : 96 ms
[2023-03-13 23:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 14 ms.
[2023-03-13 23:28:09] [INFO ] Time to serialize gal into /tmp/UpperBounds7854322488952470879.gal : 26 ms
[2023-03-13 23:28:09] [INFO ] Time to serialize properties into /tmp/UpperBounds4282260481649072830.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7854322488952470879.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4282260481649072830.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds4282260481649072830.prop.
Detected timeout of ITS tools.
[2023-03-13 23:48:41] [INFO ] Applying decomposition
[2023-03-13 23:48:41] [INFO ] Flatten gal took : 198 ms
[2023-03-13 23:48:41] [INFO ] Decomposing Gal with order
[2023-03-13 23:48:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 23:48:41] [INFO ] Removed a total of 751 redundant transitions.
[2023-03-13 23:48:41] [INFO ] Flatten gal took : 149 ms
[2023-03-13 23:48:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 33 ms.
[2023-03-13 23:48:41] [INFO ] Time to serialize gal into /tmp/UpperBounds8777601880750544414.gal : 38 ms
[2023-03-13 23:48:41] [INFO ] Time to serialize properties into /tmp/UpperBounds12346598320395867816.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8777601880750544414.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12346598320395867816.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...296
Loading property file /tmp/UpperBounds12346598320395867816.prop.
Detected timeout of ITS tools.
[2023-03-14 00:09:05] [INFO ] Flatten gal took : 266 ms
[2023-03-14 00:09:07] [INFO ] Input system was already deterministic with 342 transitions.
[2023-03-14 00:09:07] [INFO ] Transformed 158 places.
[2023-03-14 00:09:07] [INFO ] Transformed 342 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-14 00:09:07] [INFO ] Time to serialize gal into /tmp/UpperBounds12968078475853387584.gal : 9 ms
[2023-03-14 00:09:07] [INFO ] Time to serialize properties into /tmp/UpperBounds16649575658921729686.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12968078475853387584.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16649575658921729686.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds16649575658921729686.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="LamportFastMutEx-COL-6"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is LamportFastMutEx-COL-6, 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 r255-tall-167856440300047"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-6.tgz
mv LamportFastMutEx-COL-6 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 ;