About the Execution of LTSMin+red for DatabaseWithMutex-COL-10
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.r105-tall-167814482001037.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 DatabaseWithMutex-COL-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814482001037
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 13:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 27K 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 DatabaseWithMutex-COL-10-UpperBounds-00
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-01
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-02
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-03
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-04
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-05
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-06
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-07
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-08
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-09
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-10
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-11
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-12
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-13
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-14
FORMULA_NAME DatabaseWithMutex-COL-10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678413974462
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=DatabaseWithMutex-COL-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 02:06:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 02:06:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 02:06:16] [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-10 02:06:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 02:06:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 450 ms
[2023-03-10 02:06:16] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-10 02:06:16] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 4 ms.
[2023-03-10 02:06:16] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 8 rows 11 cols
[2023-03-10 02:06:16] [INFO ] Computed 4 place invariants in 5 ms
FORMULA DatabaseWithMutex-COL-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-12 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-10 02:06:16] [INFO ] Invariant cache hit.
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 02:06:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:16] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:16] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:06:16] [INFO ] Added : 6 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:16] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 5 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 10 ms.
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 7 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 4 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 3 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 8 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 3 ms.
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 3 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-10 02:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-10 02:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:17] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-10 02:06:17] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 02:06:17] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [10, 90, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2023-03-10 02:06:17] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 28 ms.
[2023-03-10 02:06:17] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 12) seen :124
FORMULA DatabaseWithMutex-COL-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :108
FORMULA DatabaseWithMutex-COL-10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-03 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :56
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :27
// Phase 1: matrix 800 rows 830 cols
[2023-03-10 02:06:18] [INFO ] Computed 130 place invariants in 38 ms
[2023-03-10 02:06:18] [INFO ] [Real]Absence check using 29 positive place invariants in 21 ms returned sat
[2023-03-10 02:06:18] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 32 ms returned sat
[2023-03-10 02:06:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:18] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-10 02:06:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:18] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:18] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 31 ms returned sat
[2023-03-10 02:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:19] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2023-03-10 02:06:19] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 63 ms.
[2023-03-10 02:06:20] [INFO ] Added : 69 causal constraints over 14 iterations in 738 ms. Result :sat
Minimization took 180 ms.
[2023-03-10 02:06:20] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:20] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 51 ms returned sat
[2023-03-10 02:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:20] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-03-10 02:06:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:20] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:20] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 53 ms returned sat
[2023-03-10 02:06:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:21] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-10 02:06:21] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 51 ms.
[2023-03-10 02:06:22] [INFO ] Added : 130 causal constraints over 26 iterations in 1438 ms. Result :sat
Minimization took 665 ms.
[2023-03-10 02:06:23] [INFO ] [Real]Absence check using 29 positive place invariants in 16 ms returned sat
[2023-03-10 02:06:23] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 42 ms returned sat
[2023-03-10 02:06:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:23] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2023-03-10 02:06:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:23] [INFO ] [Nat]Absence check using 29 positive place invariants in 15 ms returned sat
[2023-03-10 02:06:23] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 58 ms returned sat
[2023-03-10 02:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:24] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-10 02:06:24] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 47 ms.
[2023-03-10 02:06:28] [INFO ] Added : 405 causal constraints over 81 iterations in 4517 ms. Result :unknown
[2023-03-10 02:06:28] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:28] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 37 ms returned sat
[2023-03-10 02:06:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:29] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-10 02:06:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:29] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:29] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 39 ms returned sat
[2023-03-10 02:06:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:29] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-10 02:06:29] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 45 ms.
[2023-03-10 02:06:34] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 6 ms to minimize.
[2023-03-10 02:06:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 02:06:34] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:34] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 33 ms returned sat
[2023-03-10 02:06:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:35] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2023-03-10 02:06:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 02:06:35] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2023-03-10 02:06:35] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 35 ms returned sat
[2023-03-10 02:06:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 02:06:35] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-10 02:06:35] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 51 ms.
[2023-03-10 02:06:36] [INFO ] Added : 69 causal constraints over 14 iterations in 745 ms. Result :sat
Minimization took 197 ms.
Current structural bounds on expressions (after SMT) : [10, 90, 10, 10, 10] Max seen :[8, 54, 9, 9, 8]
FORMULA DatabaseWithMutex-COL-10-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 2 with 200 rules applied. Total rules applied 510 place count 620 transition count 500
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 610 place count 520 transition count 500
Free-agglomeration rule applied 100 times.
Iterating global reduction 4 with 100 rules applied. Total rules applied 710 place count 520 transition count 400
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 810 place count 420 transition count 400
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 5 with 100 rules applied. Total rules applied 910 place count 420 transition count 300
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 1010 place count 320 transition count 300
Applied a total of 1010 rules in 182 ms. Remains 320 /830 variables (removed 510) and now considering 300/800 (removed 500) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 320/830 places, 300/800 transitions.
// Phase 1: matrix 300 rows 320 cols
[2023-03-10 02:06:41] [INFO ] Computed 120 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6358 ms. (steps per millisecond=157 ) properties (out of 1) seen :62
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3178 ms. (steps per millisecond=314 ) properties (out of 1) seen :90
FORMULA DatabaseWithMutex-COL-10-UpperBounds-01 90 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 34913 ms.
ITS solved all properties within timeout
BK_STOP 1678414012062
--------------------
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
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="DatabaseWithMutex-COL-10"
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 DatabaseWithMutex-COL-10, 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 r105-tall-167814482001037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-COL-10.tgz
mv DatabaseWithMutex-COL-10 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 ;