About the Execution of Marcie+red for LamportFastMutEx-COL-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8050.023 | 3600000.00 | 3645440.00 | 6784.50 | 7 7 7 7 1 8 8 56 ? 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.r234-tall-167856420200389.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is LamportFastMutEx-COL-8, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420200389
=====================================================================
--------------------
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 1679491110928
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-8
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 13:18:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 13:18:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 13:18:32] [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 13:18:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 13:18:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 661 ms
[2023-03-22 13:18:33] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 315 PT places and 837.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 13:18:33] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 3 ms.
[2023-03-22 13:18:33] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 17 rows 15 cols
[2023-03-22 13:18:33] [INFO ] Computed 2 place invariants in 7 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 13:18:33] [INFO ] Invariant cache hit.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-22 13:18:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 13:18:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:33] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 137 ms.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:33] [INFO ] Added : 11 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:33] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 13:18:33] [INFO ] Added : 7 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:33] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 13:18:33] [INFO ] Added : 5 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 13:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:33] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 13:18:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:34] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:34] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 13:18:34] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 13:18:34] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 13:18:34] [INFO ] Added : 7 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 13:18:34] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 13:18:34] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 13:18:34] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 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 13:18:34] [INFO ] Unfolded HLPN to a Petri net with 315 places and 666 transitions 2934 arcs in 32 ms.
[2023-03-22 13:18:34] [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 75 ms. (steps per millisecond=133 ) properties (out of 12) seen :111
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 :73
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 :92
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 :88
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :78
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 14 ms. (steps per millisecond=714 ) properties (out of 11) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :87
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :95
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 19 ms. (steps per millisecond=526 ) properties (out of 10) 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 10) seen :37
FORMULA LamportFastMutEx-COL-8-UpperBounds-14 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-22 13:18:34] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 13:18:34] [INFO ] Computed 82 place invariants in 11 ms
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:34] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-22 13:18:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:34] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 13:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:35] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:18:35] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:18:35] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 4 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 0 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:18:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 653 ms
[2023-03-22 13:18:35] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 35 ms.
[2023-03-22 13:18:36] [INFO ] Added : 37 causal constraints over 8 iterations in 271 ms. Result :sat
Minimization took 90 ms.
[2023-03-22 13:18:36] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 13:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:36] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-22 13:18:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:36] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 13:18:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 42 ms returned sat
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-03-22 13:18:36] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:18:37] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:18:38] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2023-03-22 13:18:38] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2023-03-22 13:18:38] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:18:38] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1734 ms
[2023-03-22 13:18:38] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 31 ms.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:18:39] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 3 ms to minimize.
[2023-03-22 13:18:40] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:18:40] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-22 13:18:40] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1041 ms
[2023-03-22 13:18:40] [INFO ] Added : 173 causal constraints over 37 iterations in 2230 ms. Result :sat
Minimization took 124 ms.
[2023-03-22 13:18:40] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:40] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2023-03-22 13:18:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:40] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:40] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-22 13:18:40] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2023-03-22 13:18:40] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:18:41] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2023-03-22 13:18:42] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 1 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 2278 ms
[2023-03-22 13:18:43] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:43] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 13:18:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:43] [INFO ] [Nat]Absence check using 82 positive place invariants in 27 ms returned sat
[2023-03-22 13:18:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:43] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 13:18:43] [INFO ] [Nat]Added 112 Read/Feed constraints in 27 ms returned sat
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:18:43] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 3 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-22 13:18:44] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 0 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 17 trap constraints in 1544 ms
[2023-03-22 13:18:45] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:45] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:18:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:45] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 13:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:45] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-22 13:18:45] [INFO ] [Nat]Added 112 Read/Feed constraints in 81 ms returned sat
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:18:45] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2023-03-22 13:18:46] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2023-03-22 13:18:47] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:18:47] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:18:47] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 0 ms to minimize.
[2023-03-22 13:18:47] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:18:47] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 2022 ms
[2023-03-22 13:18:47] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 30 ms.
[2023-03-22 13:18:48] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 1 ms to minimize.
[2023-03-22 13:18:48] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 1 ms to minimize.
[2023-03-22 13:18:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-22 13:18:48] [INFO ] Added : 113 causal constraints over 24 iterations in 1166 ms. Result :sat
Minimization took 505 ms.
[2023-03-22 13:18:49] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:49] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-22 13:18:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:49] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 13:18:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:49] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 13:18:49] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2023-03-22 13:18:49] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2023-03-22 13:18:49] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:18:49] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-22 13:18:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 51 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 47 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 13:18:50] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 995 ms
[2023-03-22 13:18:50] [INFO ] Added : 40 causal constraints over 8 iterations in 1264 ms. Result :sat
Minimization took 69 ms.
[2023-03-22 13:18:50] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:50] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:18:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:50] [INFO ] [Nat]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 13:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:51] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 13:18:51] [INFO ] [Nat]Added 112 Read/Feed constraints in 20 ms returned sat
[2023-03-22 13:18:51] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2023-03-22 13:18:51] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2023-03-22 13:18:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2023-03-22 13:18:51] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 29 ms.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 1 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 1 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 1 ms to minimize.
[2023-03-22 13:18:52] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:18:53] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:18:53] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:18:53] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 1 ms to minimize.
[2023-03-22 13:18:53] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2023-03-22 13:18:53] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1336 ms
[2023-03-22 13:18:53] [INFO ] Added : 144 causal constraints over 30 iterations in 2238 ms. Result :sat
Minimization took 219 ms.
[2023-03-22 13:18:53] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:53] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:18:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:53] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:54] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2023-03-22 13:18:54] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-22 13:18:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 16 trap constraints in 1130 ms
[2023-03-22 13:18:55] [INFO ] [Real]Absence check using 82 positive place invariants in 15 ms returned sat
[2023-03-22 13:18:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:55] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:18:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:18:55] [INFO ] [Nat]Absence check using 82 positive place invariants in 29 ms returned sat
[2023-03-22 13:18:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:18:55] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-03-22 13:18:55] [INFO ] [Nat]Added 112 Read/Feed constraints in 88 ms returned sat
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 1 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:18:55] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 834 ms
[2023-03-22 13:18:56] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 28 ms.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2023-03-22 13:18:56] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:18:57] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2023-03-22 13:18:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 366 ms
[2023-03-22 13:18:57] [INFO ] Added : 43 causal constraints over 10 iterations in 687 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [8, 8, 7, 7, 64, 8, 8, 7, 64] Max seen :[4, 6, 7, 7, 50, 4, 1, 7, 27]
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 34 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 35 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 13:18:59] [INFO ] Computed 82 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4024 ms. (steps per millisecond=248 ) properties (out of 6) seen :104
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 6) seen :81
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 6) seen :80
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 6) seen :84
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 6) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=1027 ) properties (out of 6) seen :100
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1855 ms. (steps per millisecond=539 ) properties (out of 6) seen :104
[2023-03-22 13:19:11] [INFO ] Flow matrix only has 416 transitions (discarded 168 similar events)
// Phase 1: matrix 416 rows 266 cols
[2023-03-22 13:19:11] [INFO ] Computed 82 place invariants in 9 ms
[2023-03-22 13:19:11] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:19:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:11] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 13:19:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:11] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:11] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 13:19:11] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:19:11] [INFO ] [Nat]Added 112 Read/Feed constraints in 24 ms returned sat
[2023-03-22 13:19:11] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2023-03-22 13:19:11] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:19:11] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 0 ms to minimize.
[2023-03-22 13:19:11] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2023-03-22 13:19:11] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 1 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 0 ms to minimize.
[2023-03-22 13:19:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 1089 ms
[2023-03-22 13:19:12] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:12] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2023-03-22 13:19:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:12] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:12] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 13:19:12] [INFO ] [Nat]Added 112 Read/Feed constraints in 62 ms returned sat
[2023-03-22 13:19:12] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2023-03-22 13:19:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 830 ms
[2023-03-22 13:19:13] [INFO ] [Real]Absence check using 82 positive place invariants in 19 ms returned sat
[2023-03-22 13:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:13] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:19:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:13] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 13:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:13] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:19:14] [INFO ] [Nat]Added 112 Read/Feed constraints in 73 ms returned sat
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2023-03-22 13:19:14] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2023-03-22 13:19:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 14 trap constraints in 1294 ms
[2023-03-22 13:19:15] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:15] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-22 13:19:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:15] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 13:19:15] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-03-22 13:19:15] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 38 ms.
[2023-03-22 13:19:16] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:19:16] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2023-03-22 13:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-03-22 13:19:16] [INFO ] Added : 53 causal constraints over 13 iterations in 605 ms. Result :sat
Minimization took 109 ms.
[2023-03-22 13:19:16] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:16] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:19:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:16] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:16] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2023-03-22 13:19:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 19 ms returned sat
[2023-03-22 13:19:16] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-22 13:19:16] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2023-03-22 13:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2023-03-22 13:19:16] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 21 ms.
[2023-03-22 13:19:17] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 1 ms to minimize.
[2023-03-22 13:19:17] [INFO ] Deduced a trap composed of 63 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:19:17] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 13:19:18] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1252 ms
[2023-03-22 13:19:18] [INFO ] Added : 144 causal constraints over 30 iterations in 2105 ms. Result :sat
Minimization took 221 ms.
[2023-03-22 13:19:19] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:19:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:19] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-03-22 13:19:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:19] [INFO ] [Nat]Absence check using 82 positive place invariants in 18 ms returned sat
[2023-03-22 13:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:19] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-22 13:19:19] [INFO ] [Nat]Added 112 Read/Feed constraints in 164 ms returned sat
[2023-03-22 13:19:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2023-03-22 13:19:19] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 13:19:19] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2023-03-22 13:19:19] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 1 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 13:19:20] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1153 ms
[2023-03-22 13:19:20] [INFO ] Computed and/alt/rep : 240/1128/240 causal constraints (skipped 168 transitions) in 25 ms.
[2023-03-22 13:19:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-22 13:19:21] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2023-03-22 13:19:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 140 ms
[2023-03-22 13:19:21] [INFO ] Added : 80 causal constraints over 16 iterations in 641 ms. Result :sat
Minimization took 199 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 56, 8, 8, 64] Max seen :[7, 7, 56, 6, 1, 49]
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 80 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 584/584 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 266 transition count 576
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 258 transition count 576
Applied a total of 16 rules in 51 ms. Remains 258 /266 variables (removed 8) and now considering 576/584 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 258/266 places, 576/584 transitions.
Normalized transition count is 408 out of 576 initially.
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 13:19:22] [INFO ] Computed 82 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3372 ms. (steps per millisecond=296 ) properties (out of 3) seen :43
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 3) seen :37
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1753 ms. (steps per millisecond=570 ) properties (out of 3) seen :62
[2023-03-22 13:19:29] [INFO ] Flow matrix only has 408 transitions (discarded 168 similar events)
// Phase 1: matrix 408 rows 258 cols
[2023-03-22 13:19:29] [INFO ] Computed 82 place invariants in 7 ms
[2023-03-22 13:19:29] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:29] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-22 13:19:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:29] [INFO ] [Nat]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:29] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-22 13:19:29] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:19:29] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2023-03-22 13:19:29] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 25 ms.
[2023-03-22 13:19:30] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 1 ms to minimize.
[2023-03-22 13:19:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 156 ms
[2023-03-22 13:19:30] [INFO ] Added : 66 causal constraints over 14 iterations in 548 ms. Result :sat
Minimization took 81 ms.
[2023-03-22 13:19:30] [INFO ] [Real]Absence check using 82 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:30] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-22 13:19:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:30] [INFO ] [Nat]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:30] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2023-03-22 13:19:30] [INFO ] [Nat]Added 112 Read/Feed constraints in 13 ms returned sat
[2023-03-22 13:19:30] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 0 ms to minimize.
[2023-03-22 13:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-22 13:19:31] [INFO ] Computed and/alt/rep : 224/984/224 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 13:19:31] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:19:31] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2023-03-22 13:19:31] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:19:31] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:19:31] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 0 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 3 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-03-22 13:19:32] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:19:33] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:19:33] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1797 ms
[2023-03-22 13:19:33] [INFO ] Added : 58 causal constraints over 13 iterations in 2182 ms. Result :sat
Minimization took 156 ms.
[2023-03-22 13:19:33] [INFO ] [Real]Absence check using 82 positive place invariants in 16 ms returned sat
[2023-03-22 13:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:33] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2023-03-22 13:19:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:33] [INFO ] [Nat]Absence check using 82 positive place invariants in 17 ms returned sat
[2023-03-22 13:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:33] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-22 13:19:33] [INFO ] [Nat]Added 112 Read/Feed constraints in 147 ms returned sat
[2023-03-22 13:19:33] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2023-03-22 13:19:33] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 1 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:19:34] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2023-03-22 13:19:35] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2023-03-22 13:19:36] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 19 trap constraints in 2368 ms
Current structural bounds on expressions (after SMT) : [8, 8, 56] Max seen :[7, 1, 56]
FORMULA LamportFastMutEx-COL-8-UpperBounds-13 56 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 16 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 576/576 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 250 transition count 568
Applied a total of 16 rules in 23 ms. Remains 250 /258 variables (removed 8) and now considering 568/576 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 250/258 places, 568/576 transitions.
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 13:19:36] [INFO ] Computed 82 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2420 ms. (steps per millisecond=413 ) properties (out of 2) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 758 ms. (steps per millisecond=1319 ) properties (out of 2) seen :6
[2023-03-22 13:19:40] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 250 cols
[2023-03-22 13:19:40] [INFO ] Computed 82 place invariants in 8 ms
[2023-03-22 13:19:40] [INFO ] [Real]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:40] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 13:19:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:40] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:19:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:40] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:19:40] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-03-22 13:19:40] [INFO ] [Nat]Added 112 Read/Feed constraints in 23 ms returned sat
[2023-03-22 13:19:40] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 26 ms.
[2023-03-22 13:19:41] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2023-03-22 13:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-22 13:19:41] [INFO ] Added : 72 causal constraints over 15 iterations in 607 ms. Result :sat
Minimization took 88 ms.
[2023-03-22 13:19:41] [INFO ] [Real]Absence check using 82 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:41] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:19:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:41] [INFO ] [Nat]Absence check using 82 positive place invariants in 14 ms returned sat
[2023-03-22 13:19:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:41] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 13:19:41] [INFO ] [Nat]Added 112 Read/Feed constraints in 12 ms returned sat
[2023-03-22 13:19:41] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 0 ms to minimize.
[2023-03-22 13:19:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-22 13:19:41] [INFO ] Computed and/alt/rep : 216/1096/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 13:19:42] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 13:19:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-22 13:19:42] [INFO ] Added : 49 causal constraints over 10 iterations in 399 ms. Result :sat
Minimization took 140 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 32 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 33 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 11 ms. Remains 250 /250 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 13:19:42] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:42] [INFO ] Invariant cache hit.
[2023-03-22 13:19:43] [INFO ] Implicit Places using invariants in 263 ms returned [154, 155, 156, 157, 158, 159, 160, 161]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 265 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 12 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 290 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 13:19:43] [INFO ] Computed 74 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 2) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 2) seen :6
[2023-03-22 13:19:46] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:19:46] [INFO ] Computed 74 place invariants in 9 ms
[2023-03-22 13:19:46] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:47] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2023-03-22 13:19:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:47] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:47] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-22 13:19:47] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:47] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2023-03-22 13:19:47] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 24 ms.
[2023-03-22 13:19:48] [INFO ] Added : 146 causal constraints over 30 iterations in 814 ms. Result :sat
Minimization took 89 ms.
[2023-03-22 13:19:48] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:48] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-22 13:19:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:48] [INFO ] [Nat]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 13:19:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:48] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-22 13:19:48] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 13:19:48] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 31 ms.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2023-03-22 13:19:49] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 1 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 0 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Deduced a trap composed of 36 places in 101 ms of which 0 ms to minimize.
[2023-03-22 13:19:50] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1519 ms
[2023-03-22 13:19:50] [INFO ] Added : 110 causal constraints over 23 iterations in 2163 ms. Result :sat
Minimization took 181 ms.
Current structural bounds on expressions (after SMT) : [8, 8] Max seen :[7, 1]
Support contains 16 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.
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.
[2023-03-22 13:19:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:51] [INFO ] Invariant cache hit.
[2023-03-22 13:19:51] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-22 13:19:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:51] [INFO ] Invariant cache hit.
[2023-03-22 13:19:51] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:51] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
[2023-03-22 13:19:51] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-22 13:19:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:51] [INFO ] Invariant cache hit.
[2023-03-22 13:19:51] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 784 ms. Remains : 242/242 places, 568/568 transitions.
Starting property specific reduction for LamportFastMutEx-COL-8-UpperBounds-08
Normalized transition count is 400 out of 568 initially.
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:19:51] [INFO ] Computed 74 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-22 13:19:51] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:19:51] [INFO ] Computed 74 place invariants in 2 ms
[2023-03-22 13:19:52] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 13:19:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:52] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 13:19:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:52] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:52] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-22 13:19:52] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:52] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2023-03-22 13:19:52] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2023-03-22 13:19:52] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2023-03-22 13:19:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-22 13:19:52] [INFO ] Added : 85 causal constraints over 19 iterations in 552 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[4]
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 21 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 22 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 13:19:53] [INFO ] Computed 74 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2157 ms. (steps per millisecond=463 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 646 ms. (steps per millisecond=1547 ) properties (out of 1) seen :1
[2023-03-22 13:19:55] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:19:55] [INFO ] Computed 74 place invariants in 12 ms
[2023-03-22 13:19:55] [INFO ] [Real]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 13:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:56] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-22 13:19:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:56] [INFO ] [Nat]Absence check using 74 positive place invariants in 13 ms returned sat
[2023-03-22 13:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:56] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-22 13:19:56] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:56] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2023-03-22 13:19:56] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 27 ms.
[2023-03-22 13:19:56] [INFO ] Added : 125 causal constraints over 25 iterations in 699 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [8] Max seen :[6]
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 21 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 21 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 9 ms. Remains 242 /242 variables (removed 0) and now considering 568/568 (removed 0) transitions.
[2023-03-22 13:19:57] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:57] [INFO ] Invariant cache hit.
[2023-03-22 13:19:57] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-22 13:19:57] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:57] [INFO ] Invariant cache hit.
[2023-03-22 13:19:57] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:57] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-22 13:19:57] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-22 13:19:57] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:19:57] [INFO ] Invariant cache hit.
[2023-03-22 13:19:58] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 734 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-08 in 6090 ms.
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 13:19:58] [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 13:19:58] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:19:58] [INFO ] Computed 74 place invariants in 4 ms
[2023-03-22 13:19:58] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 13:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:58] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-22 13:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:19:58] [INFO ] [Nat]Absence check using 74 positive place invariants in 10 ms returned sat
[2023-03-22 13:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:19:58] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-22 13:19:58] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:19:58] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 13:19:58] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 23 ms.
[2023-03-22 13:19:58] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 0 ms to minimize.
[2023-03-22 13:19:59] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2023-03-22 13:20:00] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2023-03-22 13:20:00] [INFO ] Deduced a trap composed of 38 places in 109 ms of which 0 ms to minimize.
[2023-03-22 13:20:00] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2023-03-22 13:20:00] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 0 ms to minimize.
[2023-03-22 13:20:00] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1580 ms
[2023-03-22 13:20:00] [INFO ] Added : 110 causal constraints over 23 iterations in 2172 ms. Result :sat
Minimization took 178 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 7 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 7 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 13:20:00] [INFO ] Computed 74 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2136 ms. (steps per millisecond=468 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 705 ms. (steps per millisecond=1418 ) properties (out of 1) seen :1
[2023-03-22 13:20:03] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
// Phase 1: matrix 400 rows 242 cols
[2023-03-22 13:20:03] [INFO ] Computed 74 place invariants in 5 ms
[2023-03-22 13:20:03] [INFO ] [Real]Absence check using 74 positive place invariants in 11 ms returned sat
[2023-03-22 13:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 13:20:03] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-22 13:20:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 13:20:03] [INFO ] [Nat]Absence check using 74 positive place invariants in 12 ms returned sat
[2023-03-22 13:20:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 13:20:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-22 13:20:03] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:20:04] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2023-03-22 13:20:04] [INFO ] Computed and/alt/rep : 216/968/216 causal constraints (skipped 176 transitions) in 22 ms.
[2023-03-22 13:20:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2023-03-22 13:20:04] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 0 ms to minimize.
[2023-03-22 13:20:04] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2023-03-22 13:20:04] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 7 places in 99 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
[2023-03-22 13:20:05] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 0 ms to minimize.
[2023-03-22 13:20:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1464 ms
[2023-03-22 13:20:06] [INFO ] Added : 110 causal constraints over 23 iterations in 2059 ms. Result :sat
Minimization took 179 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 7 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 7 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 13:20:06] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:20:06] [INFO ] Invariant cache hit.
[2023-03-22 13:20:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-22 13:20:06] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:20:06] [INFO ] Invariant cache hit.
[2023-03-22 13:20:06] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-22 13:20:06] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-22 13:20:06] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-22 13:20:06] [INFO ] Flow matrix only has 400 transitions (discarded 168 similar events)
[2023-03-22 13:20:06] [INFO ] Invariant cache hit.
[2023-03-22 13:20:07] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 242/242 places, 568/568 transitions.
Ending property specific reduction for LamportFastMutEx-COL-8-UpperBounds-10 in 9131 ms.
[2023-03-22 13:20:07] [INFO ] Flatten gal took : 85 ms
[2023-03-22 13:20:07] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-22 13:20:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 242 places, 568 transitions and 2888 arcs took 4 ms.
Total runtime 95009 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: LamportFastMutEx_COL_8_unf
(NrP: 242 NrTr: 568 NrArc: 2888)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.012sec
net check time: 0m 0.000sec
init dd package: 0m 2.700sec
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8095520 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16094520 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.005sec
22174 65471 93734 683665 848118 227788 218622 650170 2262132 2346017
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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is 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 r234-tall-167856420200389"
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 ;