About the Execution of LTSMin+red for LamportFastMutEx-COL-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 816.712 | 833705.00 | 3255784.00 | 416.90 | 4 5 4 5 4 4 5 1 20 5 5 4 5 4 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r233-tall-167856418800365.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 ltsminxred
Input is LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418800365
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 12K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:44 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 41K 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-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679507164844
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 17:46:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-22 17:46:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 17:46:06] [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 17:46:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 17:46:07] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 696 ms
[2023-03-22 17:46:07] [INFO ] Imported 18 HL places and 17 HL transitions for a total of 174 PT places and 396.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2023-03-22 17:46:07] [INFO ] Built PT skeleton of HLPN with 18 places and 17 transitions 68 arcs in 4 ms.
[2023-03-22 17:46:07] [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 17:46:07] [INFO ] Computed 2 place invariants in 4 ms
FORMULA LamportFastMutEx-COL-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-22 17:46:07] [INFO ] Invariant cache hit.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-22 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 17:46:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 17:46:07] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-22 17:46:07] [INFO ] Added : 5 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-22 17:46:07] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-22 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:46:07] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 17:46:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-22 17:46:08] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:46:08] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 3 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:46:08] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:46:08] [INFO ] Added : 5 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:46:08] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:46:08] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:46:08] [INFO ] Added : 7 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-22 17:46:08] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-22 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-22 17:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-22 17:46:08] [INFO ] Computed and/alt/rep : 16/20/16 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-22 17:46:08] [INFO ] Added : 11 causal constraints over 3 iterations in 24 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 5, 5, 5, 5, 5, 5, 25, 5, 5, 5, 5]
Domain [pid(6), pid(6)] 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 17:46:08] [INFO ] Unfolded HLPN to a Petri net with 174 places and 318 transitions 1380 arcs in 29 ms.
[2023-03-22 17:46:08] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 58 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :60
FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-03 5 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :43
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 :35
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :37
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :32
FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :35
[2023-03-22 17:46:08] [INFO ] Flow matrix only has 200 transitions (discarded 60 similar events)
// Phase 1: matrix 200 rows 137 cols
[2023-03-22 17:46:08] [INFO ] Computed 37 place invariants in 18 ms
[2023-03-22 17:46:09] [INFO ] [Real]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 17:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 17:46:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:09] [INFO ] [Nat]Absence check using 37 positive place invariants in 13 ms returned sat
[2023-03-22 17:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:09] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2023-03-22 17:46:09] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 17:46:09] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 6 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:46:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 13 trap constraints in 735 ms
[2023-03-22 17:46:09] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:10] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 8 ms returned sat
[2023-03-22 17:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:10] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:46:10] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:46:10] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 17 ms.
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 0 ms to minimize.
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 17:46:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 212 ms
[2023-03-22 17:46:10] [INFO ] Added : 59 causal constraints over 14 iterations in 441 ms. Result :sat
Minimization took 73 ms.
[2023-03-22 17:46:10] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:10] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-22 17:46:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:10] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-22 17:46:10] [INFO ] [Nat]Added 55 Read/Feed constraints in 11 ms returned sat
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2023-03-22 17:46:10] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 525 ms
[2023-03-22 17:46:11] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:11] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-22 17:46:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:11] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:11] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:46:11] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2023-03-22 17:46:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 3 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 570 ms
[2023-03-22 17:46:12] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:12] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 17:46:12] [INFO ] [Nat]Added 55 Read/Feed constraints in 10 ms returned sat
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 0 ms to minimize.
[2023-03-22 17:46:12] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 563 ms
[2023-03-22 17:46:12] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:12] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:13] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-22 17:46:13] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2023-03-22 17:46:13] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 13 ms.
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2023-03-22 17:46:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 174 ms
[2023-03-22 17:46:13] [INFO ] Added : 86 causal constraints over 19 iterations in 484 ms. Result :sat
Minimization took 92 ms.
[2023-03-22 17:46:13] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:13] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:46:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:13] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:13] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:13] [INFO ] [Nat]Added 55 Read/Feed constraints in 19 ms returned sat
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:13] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 553 ms
[2023-03-22 17:46:14] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-22 17:46:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:14] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:14] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:46:14] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2023-03-22 17:46:14] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 448 ms
[2023-03-22 17:46:15] [INFO ] Computed and/alt/rep : 175/790/175 causal constraints (skipped 20 transitions) in 14 ms.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-22 17:46:15] [INFO ] Added : 74 causal constraints over 16 iterations in 458 ms. Result :sat
Minimization took 89 ms.
[2023-03-22 17:46:15] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:15] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-22 17:46:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:15] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:15] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:15] [INFO ] [Nat]Added 55 Read/Feed constraints in 16 ms returned sat
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 10 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-22 17:46:15] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2023-03-22 17:46:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 568 ms
Current structural bounds on expressions (after SMT) : [4, 5, 4, 4, 4, 5, 20, 5, 4] Max seen :[4, 3, 4, 4, 4, 1, 20, 3, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA LamportFastMutEx-COL-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 260/260 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 137 transition count 255
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 132 transition count 255
Applied a total of 10 rules in 35 ms. Remains 132 /137 variables (removed 5) and now considering 255/260 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 132/137 places, 255/260 transitions.
Normalized transition count is 195 out of 255 initially.
// Phase 1: matrix 195 rows 132 cols
[2023-03-22 17:46:16] [INFO ] Computed 37 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 2) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 2) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 2) seen :5
[2023-03-22 17:46:19] [INFO ] Flow matrix only has 195 transitions (discarded 60 similar events)
// Phase 1: matrix 195 rows 132 cols
[2023-03-22 17:46:19] [INFO ] Computed 37 place invariants in 5 ms
[2023-03-22 17:46:19] [INFO ] [Real]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:19] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:46:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:19] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:19] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 17:46:19] [INFO ] [Nat]Added 55 Read/Feed constraints in 8 ms returned sat
[2023-03-22 17:46:19] [INFO ] Computed and/alt/rep : 165/730/165 causal constraints (skipped 25 transitions) in 16 ms.
[2023-03-22 17:46:19] [INFO ] Added : 90 causal constraints over 18 iterations in 309 ms. Result :sat
Minimization took 119 ms.
[2023-03-22 17:46:20] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:20] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:20] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-22 17:46:20] [INFO ] [Nat]Added 55 Read/Feed constraints in 12 ms returned sat
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2023-03-22 17:46:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 634 ms
Current structural bounds on expressions (after SMT) : [5, 4] Max seen :[1, 4]
FORMULA LamportFastMutEx-COL-5-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 255/255 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 127 transition count 250
Applied a total of 10 rules in 16 ms. Remains 127 /132 variables (removed 5) and now considering 250/255 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 127/132 places, 250/255 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 17:46:20] [INFO ] Computed 37 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1585 ms. (steps per millisecond=630 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 1) seen :1
[2023-03-22 17:46:23] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 127 cols
[2023-03-22 17:46:23] [INFO ] Computed 37 place invariants in 2 ms
[2023-03-22 17:46:23] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:23] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-22 17:46:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:23] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:23] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:46:23] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-22 17:46:23] [INFO ] [Nat]Added 55 Read/Feed constraints in 7 ms returned sat
[2023-03-22 17:46:23] [INFO ] Computed and/alt/rep : 160/770/160 causal constraints (skipped 25 transitions) in 15 ms.
[2023-03-22 17:46:23] [INFO ] Added : 24 causal constraints over 6 iterations in 101 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 127/127 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 250/250 transitions.
Applied a total of 0 rules in 17 ms. Remains 127 /127 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 17:46:23] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:23] [INFO ] Invariant cache hit.
[2023-03-22 17:46:23] [INFO ] Implicit Places using invariants in 137 ms returned [82, 83, 84, 85, 86]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 139 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 122/127 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 165 ms. Remains : 122/127 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:23] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 1) seen :1
[2023-03-22 17:46:25] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:25] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-22 17:46:25] [INFO ] [Real]Absence check using 32 positive place invariants in 28 ms returned sat
[2023-03-22 17:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:25] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-22 17:46:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:25] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-22 17:46:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 17:46:25] [INFO ] [Nat]Added 30 Read/Feed constraints in 5 ms returned sat
[2023-03-22 17:46:26] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 0 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 0 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2023-03-22 17:46:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 439 ms
[2023-03-22 17:46:26] [INFO ] Added : 65 causal constraints over 13 iterations in 633 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 8 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 17:46:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:26] [INFO ] Invariant cache hit.
[2023-03-22 17:46:26] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-22 17:46:26] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:26] [INFO ] Invariant cache hit.
[2023-03-22 17:46:26] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 17:46:27] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-22 17:46:27] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-22 17:46:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:27] [INFO ] Invariant cache hit.
[2023-03-22 17:46:27] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 122/122 places, 250/250 transitions.
Starting property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:27] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
[2023-03-22 17:46:27] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:27] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-22 17:46:27] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:27] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-22 17:46:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-22 17:46:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:27] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-22 17:46:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 17:46:27] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-22 17:46:27] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 17:46:27] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2023-03-22 17:46:27] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2023-03-22 17:46:27] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2023-03-22 17:46:27] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 0 ms to minimize.
[2023-03-22 17:46:27] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2023-03-22 17:46:28] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2023-03-22 17:46:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 414 ms
[2023-03-22 17:46:28] [INFO ] Added : 65 causal constraints over 13 iterations in 608 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 122/122 places, 250/250 transitions.
Normalized transition count is 190 out of 250 initially.
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:28] [INFO ] Computed 32 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1607 ms. (steps per millisecond=622 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :1
[2023-03-22 17:46:30] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
// Phase 1: matrix 190 rows 122 cols
[2023-03-22 17:46:30] [INFO ] Computed 32 place invariants in 3 ms
[2023-03-22 17:46:30] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-22 17:46:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:30] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-22 17:46:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 17:46:30] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-22 17:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 17:46:30] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-22 17:46:30] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 17:46:30] [INFO ] [Nat]Added 30 Read/Feed constraints in 6 ms returned sat
[2023-03-22 17:46:30] [INFO ] Computed and/alt/rep : 160/720/160 causal constraints (skipped 25 transitions) in 14 ms.
[2023-03-22 17:46:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 0 ms to minimize.
[2023-03-22 17:46:30] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-22 17:46:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-22 17:46:31] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2023-03-22 17:46:31] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2023-03-22 17:46:31] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2023-03-22 17:46:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 429 ms
[2023-03-22 17:46:31] [INFO ] Added : 65 causal constraints over 13 iterations in 621 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[1]
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 122/122 places, 250/250 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 122 /122 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 17:46:31] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:31] [INFO ] Invariant cache hit.
[2023-03-22 17:46:31] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-22 17:46:31] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:31] [INFO ] Invariant cache hit.
[2023-03-22 17:46:31] [INFO ] State equation strengthened by 30 read => feed constraints.
[2023-03-22 17:46:31] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-22 17:46:31] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-22 17:46:31] [INFO ] Flow matrix only has 190 transitions (discarded 60 similar events)
[2023-03-22 17:46:31] [INFO ] Invariant cache hit.
[2023-03-22 17:46:31] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 122/122 places, 250/250 transitions.
Ending property specific reduction for LamportFastMutEx-COL-5-UpperBounds-07 in 4567 ms.
[2023-03-22 17:46:31] [INFO ] Flatten gal took : 104 ms
[2023-03-22 17:46:31] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-22 17:46:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 122 places, 250 transitions and 1160 arcs took 3 ms.
Total runtime 25627 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/985/ub_0_
FORMULA LamportFastMutEx-COL-5-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
BK_STOP 1679507998549
--------------------
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
mcc2023
ub formula name LamportFastMutEx-COL-5-UpperBounds-07
ub formula formula --maxsum=/tmp/985/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 122 places, 250 transitions and 1160 arcs
pnml2lts-sym: Petri net LamportFastMutEx_COL_5_unf analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 250->215 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 122; there are 215 groups
pnml2lts-sym: Computing maximum sum over 5 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 77008515 group checks and 0 next state calls
pnml2lts-sym: reachability took 793.610 real 3153.320 user 17.260 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.130 real 0.490 user 0.000 sys
pnml2lts-sym: state space has 435092592 states, 1595234 nodes
pnml2lts-sym: Maximum sum of /tmp/985/ub_0_ is: 1
pnml2lts-sym: group_next: 1969 nodes total
pnml2lts-sym: group_explored: 2300 nodes, 3340 short vectors total
pnml2lts-sym: max token count: 1
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-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is LamportFastMutEx-COL-5, 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 r233-tall-167856418800365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 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 ;