About the Execution of ITS-Tools for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16220.592 | 3600000.00 | 2678685.00 | 571020.70 | 7 7 7 7 1 8 8 56 8 1 ? 8 7 56 8 8 | 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.r229-tall-167856413200389.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 itstools
Input is LamportFastMutEx-COL-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r229-tall-167856413200389
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.5K Feb 25 13:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 13:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 13:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 25 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:50 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 44K 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-8-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-8-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679481031806
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202303021504
[2023-03-22 10:30:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 10:30:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 10:30:33] [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-22 10:30:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 10:30:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 465 ms
[2023-03-22 10:30:33] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 10:30:34] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 10:30:34] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 10:30:34] [INFO ] Computed 2 place invariants in 6 ms
FORMULA LamportFastMutEx-COL-8-UpperBounds-15 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-06 8 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-8-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 10:30:34] [INFO ] Invariant cache hit.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 10:30:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 10:30:34] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 10:30:34] [INFO ] Added : 11 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-22 10:30:34] [INFO ] Added : 6 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:30:34] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:30:34] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-22 10:30:34] [INFO ] Added : 11 causal constraints over 3 iterations in 23 ms. Result :sat
Minimization took 10 ms.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 10:30:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:30:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:30:34] [INFO ] Added : 5 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:30:35] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:30:35] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 10:30:35] [INFO ] Added : 7 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:30:35] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 11 ms.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 10:30:35] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 10:30:35] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 8, 8, 8, 64, 8, 8, 8, 8, 64, 8]
Domain [pid(9), pid(9)] 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-22 10:30:35] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 37 ms.
[2023-03-22 10:30:35] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 49 places in 3 ms
Reduce places removed 49 places and 82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :107
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :67
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :74
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :89
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :116
FORMULA LamportFastMutEx-COL-8-UpperBounds-05 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 11) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :71
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :94
FORMULA LamportFastMutEx-COL-8-UpperBounds-11 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :84
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :37
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 10:30:35] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 10:30:35] [INFO ] Computed 82 place invariants in 10 ms
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:35] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2023-03-22 10:30:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:35] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:30:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:36] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 10:30:36] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 10:30:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 16 ms returned sat
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 8 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 0 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2023-03-22 10:30:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 691 ms
[2023-03-22 10:30:36] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 37 ms.
[2023-03-22 10:30:37] [INFO ] Added : 37 causal constraints over 8 iterations in 281 ms. Result :sat
Minimization took 86 ms.
[2023-03-22 10:30:37] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:30:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:37] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 10:30:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:37] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:30:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:37] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 10:30:37] [INFO ] [Nat]Added 112 Read/Feed constraints in 44 ms returned sat
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:30:37] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 1 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-22 10:30:38] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-22 10:30:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:30:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:30:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:30:39] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1732 ms
[2023-03-22 10:30:39] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 0 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 0 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2023-03-22 10:30:40] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 4 ms to minimize.
[2023-03-22 10:30:41] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 0 ms to minimize.
[2023-03-22 10:30:41] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2023-03-22 10:30:41] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1104 ms
[2023-03-22 10:30:41] [INFO ] Added : 173 causal constraints over 37 iterations in 2227 ms. Result :sat
Minimization took 116 ms.
[2023-03-22 10:30:41] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:41] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-22 10:30:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:41] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:41] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2023-03-22 10:30:41] [INFO ] [Nat]Added 112 Read/Feed constraints in 30 ms returned sat
[2023-03-22 10:30:41] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 1 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 1 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 0 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 0 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 42 places in 89 ms of which 0 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2023-03-22 10:30:42] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 41 places in 99 ms of which 1 ms to minimize.
[2023-03-22 10:30:43] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 0 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 5 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2228 ms
[2023-03-22 10:30:44] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-22 10:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:44] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 10:30:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:44] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:44] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 10:30:44] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 0 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-22 10:30:44] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-22 10:30:45] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 0 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1651 ms
[2023-03-22 10:30:46] [INFO ] [Real]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 10:30:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:46] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-22 10:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:46] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:46] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-03-22 10:30:46] [INFO ] [Nat]Added 112 Read/Feed constraints in 87 ms returned sat
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2023-03-22 10:30:46] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 1 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 1 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 14 places in 125 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2023-03-22 10:30:47] [INFO ] Deduced a trap composed of 31 places in 120 ms of which 1 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2023-03-22 10:30:48] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-22 10:30:49] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2767 ms
[2023-03-22 10:30:49] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 41 ms.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 0 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2023-03-22 10:30:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 714 ms
[2023-03-22 10:30:51] [INFO ] Added : 114 causal constraints over 24 iterations in 1789 ms. Result :sat
Minimization took 186 ms.
[2023-03-22 10:30:51] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:51] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-22 10:30:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:51] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:30:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 10:30:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 10:30:51] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2023-03-22 10:30:51] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 1 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 63 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 1 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:30:52] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 995 ms
[2023-03-22 10:30:52] [INFO ] Added : 40 causal constraints over 8 iterations in 1276 ms. Result :sat
Minimization took 70 ms.
[2023-03-22 10:30:52] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:53] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2023-03-22 10:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:53] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-03-22 10:30:53] [INFO ] [Nat]Added 112 Read/Feed constraints in 20 ms returned sat
[2023-03-22 10:30:53] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 0 ms to minimize.
[2023-03-22 10:30:53] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:30:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 173 ms
[2023-03-22 10:30:53] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 32 ms.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 0 ms to minimize.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 0 ms to minimize.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 0 ms to minimize.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2023-03-22 10:30:54] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:30:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1343 ms
[2023-03-22 10:30:55] [INFO ] Added : 144 causal constraints over 30 iterations in 2214 ms. Result :sat
Minimization took 217 ms.
[2023-03-22 10:30:55] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:55] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-22 10:30:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:56] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:56] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 10:30:56] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-22 10:30:56] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1084 ms
[2023-03-22 10:30:57] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 10:30:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 10:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:30:57] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:30:57] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-22 10:30:57] [INFO ] [Nat]Added 112 Read/Feed constraints in 73 ms returned sat
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2023-03-22 10:30:57] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 635 ms
[2023-03-22 10:30:58] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 26 ms.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2023-03-22 10:30:58] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 0 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 0 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 0 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:30:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 874 ms
[2023-03-22 10:30:59] [INFO ] Added : 63 causal constraints over 14 iterations in 1301 ms. Result :sat
Minimization took 234 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 7, 7, 64, 8, 8, 7, 64] Max seen :[4, 6, 7, 7, 49, 4, 1, 7, 32]
FORMULA LamportFastMutEx-COL-8-UpperBounds-12 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 160 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Applied a total of 0 rules in 31 ms. Remains 266 /266 variables (removed 0) and now considering 584/584 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 266/266 places, 584/584 transitions.
Normalized transition count is 416 out of 584 initially.
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 10:31:01] [INFO ] Computed 82 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4111 ms. (steps per millisecond=243 ) properties (out of 6) seen :100
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 968 ms. (steps per millisecond=1033 ) properties (out of 6) seen :76
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 6) seen :85
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2155 ms. (steps per millisecond=464 ) properties (out of 6) seen :83
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1037 ms. (steps per millisecond=964 ) properties (out of 6) seen :89
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1852 ms. (steps per millisecond=539 ) properties (out of 6) seen :114
[2023-03-22 10:31:13] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 10:31:13] [INFO ] Computed 82 place invariants in 9 ms
[2023-03-22 10:31:13] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:13] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 10:31:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:13] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:31:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:14] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 10:31:14] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 10:31:14] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
[2023-03-22 10:31:14] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1069 ms
[2023-03-22 10:31:15] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:15] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-03-22 10:31:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:31:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:15] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 10:31:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 63 ms returned sat
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:31:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 870 ms
[2023-03-22 10:31:16] [INFO ] [Real]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:31:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:16] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2023-03-22 10:31:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:16] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2023-03-22 10:31:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 81 ms returned sat
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:31:16] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2023-03-22 10:31:17] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-22 10:31:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1399 ms
[2023-03-22 10:31:18] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:31:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:18] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 10:31:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:18] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 10:31:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:18] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 10:31:18] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 10:31:18] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
[2023-03-22 10:31:18] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:31:18] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:31:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 181 ms
[2023-03-22 10:31:19] [INFO ] Added : 53 causal constraints over 13 iterations in 554 ms. Result :sat
Minimization took 108 ms.
[2023-03-22 10:31:19] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:31:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:19] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-22 10:31:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:31:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:19] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 10:31:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 20 ms returned sat
[2023-03-22 10:31:19] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:31:19] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-22 10:31:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-22 10:31:19] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 25 ms.
[2023-03-22 10:31:20] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 1 ms to minimize.
[2023-03-22 10:31:20] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 0 ms to minimize.
[2023-03-22 10:31:20] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2023-03-22 10:31:20] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 10 places in 99 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 1 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2023-03-22 10:31:21] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1328 ms
[2023-03-22 10:31:21] [INFO ] Added : 144 causal constraints over 30 iterations in 2170 ms. Result :sat
Minimization took 217 ms.
[2023-03-22 10:31:22] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 10:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:22] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-22 10:31:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:22] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 10:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:22] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 10:31:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 151 ms returned sat
[2023-03-22 10:31:22] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2023-03-22 10:31:22] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 10:31:22] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 0 ms to minimize.
[2023-03-22 10:31:22] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-03-22 10:31:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-22 10:31:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-22 10:31:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 1763 ms
Current structural bounds on expressions (after SMT) : [7, 7, 56, 8, 8, 56] Max seen :[7, 7, 56, 6, 1, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-13 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-07 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-8-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 16 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 258 transition count 576
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 258 transition count 568
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 32 place count 250 transition count 568
Applied a total of 32 rules in 77 ms. Remains 250 /266 variables (removed 16) and now considering 568/584 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 250/266 places, 568/584 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 10:31:24] [INFO ] Computed 82 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2492 ms. (steps per millisecond=401 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 710 ms. (steps per millisecond=1408 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 2) seen :6
[2023-03-22 10:31:28] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 10:31:28] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-22 10:31:28] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 10:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:29] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 10:31:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:29] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 10:31:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:29] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 10:31:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 10:31:29] [INFO ] [Nat]Added 112 Read/Feed constraints in 25 ms returned sat
[2023-03-22 10:31:29] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 25 ms.
[2023-03-22 10:31:29] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2023-03-22 10:31:29] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 0 ms to minimize.
[2023-03-22 10:31:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 280 ms
[2023-03-22 10:31:30] [INFO ] Added : 77 causal constraints over 16 iterations in 775 ms. Result :sat
Minimization took 96 ms.
[2023-03-22 10:31:30] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-22 10:31:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:30] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-22 10:31:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:30] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 10:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:30] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 10:31:30] [INFO ] [Nat]Added 112 Read/Feed constraints in 11 ms returned sat
[2023-03-22 10:31:30] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 10:31:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2023-03-22 10:31:30] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2023-03-22 10:31:30] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-22 10:31:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2023-03-22 10:31:31] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 2 ms to minimize.
[2023-03-22 10:31:31] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2023-03-22 10:31:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 416 ms
[2023-03-22 10:31:31] [INFO ] Added : 54 causal constraints over 12 iterations in 726 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[7, 1]
Support contains 16 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 250/250 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 568/568 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 10:31:31] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:31] [INFO ] Invariant cache hit.
[2023-03-22 10:31:31] [INFO ] Implicit Places using invariants in 217 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 220 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 242/250 places, 568/568 transitions.
Applied a total of 0 rules in 11 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 244 ms. Remains : 242/250 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:31] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2352 ms. (steps per millisecond=425 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 694 ms. (steps per millisecond=1440 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 759 ms. (steps per millisecond=1317 ) properties (out of 2) seen :6
[2023-03-22 10:31:35] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:35] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-22 10:31:35] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 10:31:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:35] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2023-03-22 10:31:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:35] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 10:31:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:35] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-22 10:31:35] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:35] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2023-03-22 10:31:36] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 25 ms.
[2023-03-22 10:31:36] [INFO ] Added : 137 causal constraints over 28 iterations in 773 ms. Result :sat
Minimization took 104 ms.
[2023-03-22 10:31:36] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 10:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:37] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 10:31:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:37] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 10:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:37] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-22 10:31:37] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2023-03-22 10:31:37] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 27 ms.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 1 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 1 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 0 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2023-03-22 10:31:38] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-22 10:31:39] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2023-03-22 10:31:39] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 0 ms to minimize.
[2023-03-22 10:31:39] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:31:39] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
[2023-03-22 10:31:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1373 ms
[2023-03-22 10:31:39] [INFO ] Added : 134 causal constraints over 27 iterations in 2184 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[7, 1]
FORMULA LamportFastMutEx-COL-8-UpperBounds-08 8 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 10 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:40] [INFO ] Computed 74 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2188 ms. (steps per millisecond=457 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 1) seen :1
[2023-03-22 10:31:43] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:43] [INFO ] Computed 74 place invariants in 8 ms
[2023-03-22 10:31:43] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 10:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:43] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 10:31:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:43] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 10:31:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:43] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 10:31:43] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:43] [INFO ] [Nat]Added 48 Read/Feed constraints in 12 ms returned sat
[2023-03-22 10:31:43] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 37 places in 97 ms of which 1 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 1 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2023-03-22 10:31:44] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 0 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 10:31:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1373 ms
[2023-03-22 10:31:45] [INFO ] Added : 134 causal constraints over 27 iterations in 2202 ms. Result :sat
Minimization took 227 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 8 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 10:31:45] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:45] [INFO ] Invariant cache hit.
[2023-03-22 10:31:46] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-22 10:31:46] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:46] [INFO ] Invariant cache hit.
[2023-03-22 10:31:46] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:46] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
[2023-03-22 10:31:46] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-22 10:31:46] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:46] [INFO ] Invariant cache hit.
[2023-03-22 10:31:46] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 810 ms. Remains : 242/242 places, 568/568 transitions.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-10
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:46] [INFO ] Computed 74 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
[2023-03-22 10:31:46] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:46] [INFO ] Computed 74 place invariants in 6 ms
[2023-03-22 10:31:46] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 10:31:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:46] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-22 10:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:47] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 10:31:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:47] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 10:31:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 11 ms returned sat
[2023-03-22 10:31:47] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 30 ms.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 0 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 0 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 10:31:48] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 0 ms to minimize.
[2023-03-22 10:31:49] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-22 10:31:49] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 0 ms to minimize.
[2023-03-22 10:31:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2023-03-22 10:31:49] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 10:31:49] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1388 ms
[2023-03-22 10:31:49] [INFO ] Added : 134 causal constraints over 27 iterations in 2181 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 18 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 242/242 places, 568/568 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:49] [INFO ] Computed 74 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2189 ms. (steps per millisecond=456 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 1) seen :1
[2023-03-22 10:31:52] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 10:31:52] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 10:31:52] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 10:31:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:52] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 10:31:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 10:31:52] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 10:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 10:31:52] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 10:31:52] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:52] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 10:31:53] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 32 ms.
[2023-03-22 10:31:53] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2023-03-22 10:31:53] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 0 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2023-03-22 10:31:54] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1285 ms
[2023-03-22 10:31:55] [INFO ] Added : 134 causal constraints over 27 iterations in 2036 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 15 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 242/242 places, 568/568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 568/568 transitions.
Applied a total of 0 rules in 7 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 10:31:55] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:55] [INFO ] Invariant cache hit.
[2023-03-22 10:31:55] [INFO ] Implicit Places using invariants in 175 ms returned []
[2023-03-22 10:31:55] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:55] [INFO ] Invariant cache hit.
[2023-03-22 10:31:55] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 10:31:56] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-22 10:31:56] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 10:31:56] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 10:31:56] [INFO ] Invariant cache hit.
[2023-03-22 10:31:56] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 794 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-10 in 9446 ms.
[2023-03-22 10:31:56] [INFO ] Flatten gal took : 72 ms
[2023-03-22 10:31:56] [INFO ] Applying decomposition
[2023-03-22 10:31:56] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph12251234607736380529.txt' '-o' '/tmp/graph12251234607736380529.bin' '-w' '/tmp/graph12251234607736380529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph12251234607736380529.bin' '-l' '-1' '-v' '-w' '/tmp/graph12251234607736380529.weights' '-q' '0' '-e' '0.001'
[2023-03-22 10:31:56] [INFO ] Decomposing Gal with order
[2023-03-22 10:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 10:31:56] [INFO ] Removed a total of 884 redundant transitions.
[2023-03-22 10:31:56] [INFO ] Flatten gal took : 85 ms
[2023-03-22 10:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 14 ms.
[2023-03-22 10:31:56] [INFO ] Time to serialize gal into /tmp/UpperBounds16569554681857120574.gal : 8 ms
[2023-03-22 10:31:56] [INFO ] Time to serialize properties into /tmp/UpperBounds10751292587050579779.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16569554681857120574.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10751292587050579779.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds10751292587050579779.prop.
Detected timeout of ITS tools.
[2023-03-22 10:52:46] [INFO ] Applying decomposition
[2023-03-22 10:52:46] [INFO ] Flatten gal took : 187 ms
[2023-03-22 10:52:46] [INFO ] Decomposing Gal with order
[2023-03-22 10:52:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-22 10:52:47] [INFO ] Removed a total of 1467 redundant transitions.
[2023-03-22 10:52:47] [INFO ] Flatten gal took : 188 ms
[2023-03-22 10:52:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 65 ms.
[2023-03-22 10:52:47] [INFO ] Time to serialize gal into /tmp/UpperBounds11393138904768827186.gal : 37 ms
[2023-03-22 10:52:47] [INFO ] Time to serialize properties into /tmp/UpperBounds12649627907358832898.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11393138904768827186.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12649627907358832898.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds12649627907358832898.prop.
Detected timeout of ITS tools.
[2023-03-22 11:13:25] [INFO ] Flatten gal took : 308 ms
[2023-03-22 11:13:26] [INFO ] Input system was already deterministic with 568 transitions.
[2023-03-22 11:13:26] [INFO ] Transformed 242 places.
[2023-03-22 11:13:26] [INFO ] Transformed 568 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/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//../itstools/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-22 11:13:26] [INFO ] Time to serialize gal into /tmp/UpperBounds4942658029860944255.gal : 20 ms
[2023-03-22 11:13:26] [INFO ] Time to serialize properties into /tmp/UpperBounds17636021780589322948.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4942658029860944255.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds17636021780589322948.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds17636021780589322948.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 148612 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15733508 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-8"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is LamportFastMutEx-COL-8, 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 r229-tall-167856413200389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-8.tgz
mv LamportFastMutEx-COL-8 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 ;