About the Execution of GreatSPN+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/mcc2024-input.r135-tall-171631130200021.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r135-tall-171631130200021
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 8.3K Apr 11 18:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 18:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 18:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 11 18:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 18:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 11 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 27K May 18 16:42 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 1716321420235
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DatabaseWithMutex-COL-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 19:57:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 19:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 19:57:01] [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.
[2024-05-21 19:57:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 19:57:02] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 568 ms
[2024-05-21 19:57:02] [INFO ] Imported 11 HL places and 8 HL transitions for a total of 830 PT places and 800.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduction of identical properties reduced properties to check from 16 to 9
[2024-05-21 19:57:02] [INFO ] Built PT skeleton of HLPN with 11 places and 8 transitions 22 arcs in 3 ms.
[2024-05-21 19:57:02] [INFO ] Skeletonized 9 HLPN properties in 0 ms.
// Phase 1: matrix 8 rows 11 cols
[2024-05-21 19:57:02] [INFO ] Computed 4 invariants in 5 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 10, 0, 0, 0, 0, 0, 10] Max Struct:[10, 90, 20, 90, 10, 10, 90, 90, 10]
FORMULA DatabaseWithMutex-COL-10-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-21 19:57:02] [INFO ] Invariant cache hit.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 10 ms.
[2024-05-21 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned unsat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 5 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-21 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-21 19:57:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-21 19:57:02] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 19:57:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-21 19:57:02] [INFO ] Computed and/alt/rep : 7/8/7 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-21 19:57:02] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 10, 0, 0, 0, 0, 0] Max Struct:[10, 90, 10, 90, 10, 10, 90, 90]
FORMULA DatabaseWithMutex-COL-10-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA DatabaseWithMutex-COL-10-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Release forces synchronizations/join behavior on parameter s of sort site
Transition Acquire forces synchronizations/join behavior on parameter f of sort file
[2024-05-21 19:57:02] [INFO ] Unfolded HLPN to a Petri net with 830 places and 800 transitions 3800 arcs in 35 ms.
[2024-05-21 19:57:02] [INFO ] Unfolded 7 HLPN properties in 1 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 90, 90, 10, 10, 90, 90]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 90, 90, 10, 10, 90, 90]
// Phase 1: matrix 800 rows 830 cols
[2024-05-21 19:57:03] [INFO ] Computed 130 invariants in 42 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 90, 90, 10, 10, 90, 90]
RANDOM walk for 10000 steps (2 resets) in 173 ms. (57 steps per ms)
FORMULA DatabaseWithMutex-COL-10-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-05 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 143 ms. (347 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 15, 59, 63, 58] Max Struct:[10, 90, 90, 90, 90]
[2024-05-21 19:57:03] [INFO ] Invariant cache hit.
[2024-05-21 19:57:03] [INFO ] [Real]Absence check using 29 positive place invariants in 47 ms returned sat
[2024-05-21 19:57:03] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 85 ms returned sat
[2024-05-21 19:57:03] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-21 19:57:04] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 72 ms.
[2024-05-21 19:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:04] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2024-05-21 19:57:04] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 35 ms returned sat
[2024-05-21 19:57:04] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2024-05-21 19:57:04] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 63 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-21 19:57:09] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2024-05-21 19:57:09] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 37 ms returned sat
[2024-05-21 19:57:09] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2024-05-21 19:57:09] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 47 ms.
[2024-05-21 19:57:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:10] [INFO ] [Nat]Absence check using 29 positive place invariants in 14 ms returned sat
[2024-05-21 19:57:10] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 36 ms returned sat
[2024-05-21 19:57:10] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2024-05-21 19:57:10] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 46 ms.
[2024-05-21 19:57:12] [INFO ] Added : 182 causal constraints over 37 iterations in 1787 ms. Result :sat
Minimization took 709 ms.
[2024-05-21 19:57:13] [INFO ] [Real]Absence check using 29 positive place invariants in 14 ms returned sat
[2024-05-21 19:57:13] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 60 ms returned sat
[2024-05-21 19:57:13] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-21 19:57:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:13] [INFO ] [Nat]Absence check using 29 positive place invariants in 15 ms returned sat
[2024-05-21 19:57:13] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 52 ms returned sat
[2024-05-21 19:57:13] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2024-05-21 19:57:14] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 47 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-21 19:57:18] [INFO ] [Real]Absence check using 29 positive place invariants in 13 ms returned sat
[2024-05-21 19:57:18] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 55 ms returned sat
[2024-05-21 19:57:18] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2024-05-21 19:57:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:19] [INFO ] [Nat]Absence check using 29 positive place invariants in 13 ms returned sat
[2024-05-21 19:57:19] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 56 ms returned sat
[2024-05-21 19:57:19] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2024-05-21 19:57:19] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 41 ms.
[2024-05-21 19:57:19] [INFO ] Added : 17 causal constraints over 4 iterations in 263 ms. Result :sat
Minimization took 724 ms.
[2024-05-21 19:57:20] [INFO ] [Real]Absence check using 29 positive place invariants in 13 ms returned sat
[2024-05-21 19:57:20] [INFO ] [Real]Absence check using 29 positive and 101 generalized place invariants in 53 ms returned sat
[2024-05-21 19:57:21] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-05-21 19:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:21] [INFO ] [Nat]Absence check using 29 positive place invariants in 12 ms returned sat
[2024-05-21 19:57:21] [INFO ] [Nat]Absence check using 29 positive and 101 generalized place invariants in 72 ms returned sat
[2024-05-21 19:57:21] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2024-05-21 19:57:21] [INFO ] Computed and/alt/rep : 600/1400/600 causal constraints (skipped 100 transitions) in 40 ms.
[2024-05-21 19:57:22] [INFO ] Added : 5 causal constraints over 1 iterations in 685 ms. Result :sat
Minimization took 707 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 15, 59, 63, 58] Max Struct:[10, 90, 90, 90, 90]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 15, 59, 63, 58] Max Struct:[10, 90, 90, 90, 90]
Support contains 500 out of 830 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 830/830 places, 800/800 transitions.
Free-agglomeration rule applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 200 place count 730 transition count 700
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 1 with 100 rules applied. Total rules applied 300 place count 730 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 400 place count 630 transition count 600
Applied a total of 400 rules in 158 ms. Remains 630 /830 variables (removed 200) and now considering 600/800 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 630/830 places, 600/800 transitions.
// Phase 1: matrix 600 rows 630 cols
[2024-05-21 19:57:23] [INFO ] Computed 130 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9, 15, 59, 63, 58] Max Struct:[10, 90, 90, 90, 90]
RANDOM walk for 1000000 steps (2 resets) in 14432 ms. (69 steps per ms)
FORMULA DatabaseWithMutex-COL-10-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-12 90 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-11 90 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-09 90 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (4 resets) in 7144 ms. (279 steps per ms)
FORMULA DatabaseWithMutex-COL-10-UpperBounds-13 90 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DatabaseWithMutex-COL-10-UpperBounds-03 90 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Current structural bounds on expressions (after WALK) : Max Seen:[19] Max Struct:[90]
[2024-05-21 19:57:44] [INFO ] Invariant cache hit.
[2024-05-21 19:57:44] [INFO ] [Real]Absence check using 28 positive place invariants in 8 ms returned sat
[2024-05-21 19:57:44] [INFO ] [Real]Absence check using 28 positive and 102 generalized place invariants in 24 ms returned sat
[2024-05-21 19:57:45] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2024-05-21 19:57:45] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 32 ms.
[2024-05-21 19:57:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 19:57:45] [INFO ] [Nat]Absence check using 28 positive place invariants in 8 ms returned sat
[2024-05-21 19:57:45] [INFO ] [Nat]Absence check using 28 positive and 102 generalized place invariants in 22 ms returned sat
[2024-05-21 19:57:45] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2024-05-21 19:57:45] [INFO ] Computed and/alt/rep : 400/1200/400 causal constraints (skipped 100 transitions) in 32 ms.
[2024-05-21 19:57:48] [INFO ] Added : 320 causal constraints over 64 iterations in 2698 ms. Result :sat
Minimization took 415 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[19] Max Struct:[90]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[90] Max Struct:[90]
Support contains 100 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 600/600 transitions.
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 100 Pre rules applied. Total rules applied 0 place count 630 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 530 transition count 500
Free-agglomeration rule (complex) applied 100 times.
Iterating global reduction 0 with 100 rules applied. Total rules applied 300 place count 530 transition count 400
Reduce places removed 110 places and 0 transitions.
Iterating post reduction 0 with 110 rules applied. Total rules applied 410 place count 420 transition count 400
Applied a total of 410 rules in 110 ms. Remains 420 /630 variables (removed 210) and now considering 400/600 (removed 200) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 420/630 places, 400/600 transitions.
// Phase 1: matrix 400 rows 420 cols
[2024-05-21 19:57:50] [INFO ] Computed 120 invariants in 8 ms
Current structural bounds on expressions (after invariants) : Max Seen:[90] Max Struct:[90]
FORMULA DatabaseWithMutex-COL-10-UpperBounds-01 90 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (2 resets) in 4339 ms. (230 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 6 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 53650 ms.
ITS solved all properties within timeout
BK_STOP 1716321475106
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r135-tall-171631130200021"
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 ;