fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r520-tall-171662337700037
Last Updated
July 7, 2024

About the Execution of LTSMin+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
575.071 92716.00 109450.00 302.70 23 23 1 13 529 1 23 1 23 1 529 23 1 23 1 23 normal

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.r520-tall-171662337700037.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 ltsminxred
Input is QuasiCertifProtocol-COL-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r520-tall-171662337700037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 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 QuasiCertifProtocol-COL-22-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-COL-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218279086

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:04:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:04:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:04:40] [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-06-01 05:04:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 05:04:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2024-06-01 05:04:40] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-06-01 05:04:40] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2024-06-01 05:04:40] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 26 rows 30 cols
[2024-06-01 05:04:41] [INFO ] Computed 5 invariants in 10 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 23, 0, 0, 0, 0, 0, 0, 23, 1, 0, 0, 0, 0, 0, 0] Max Struct:[23, 23, 1, 13, 529, 1, 23, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-08 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-01 23 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-06-01 05:04:41] [INFO ] Invariant cache hit.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 9 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:04:41] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:41] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:41] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:41] [INFO ] Added : 13 causal constraints over 3 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:41] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:41] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:41] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:41] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:41] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:41] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:41] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:41] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 05:04:41] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:42] [INFO ] Added : 6 causal constraints over 2 iterations in 13 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:42] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:42] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:42] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:42] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:42] [INFO ] Added : 13 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:42] [INFO ] Added : 13 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 8 ms.
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 05:04:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:42] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:04:42] [INFO ] Computed and/alt/rep : 24/31/24 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:42] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-06-01 05:04:42] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 27 ms.
[2024-06-01 05:04:42] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +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, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
// Phase 1: matrix 356 rows 1966 cols
[2024-06-01 05:04:42] [INFO ] Computed 1611 invariants in 65 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[23, 1, 13, 529, 1, 23, 1, +inf, +inf, 1, +inf, 1, +inf]
RANDOM walk for 10000 steps (370 resets) in 248 ms. (40 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (219 resets) in 385 ms. (259 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 23, 0, 23, 0] Max Struct:[13, 529, 1, 23, 1, +inf, +inf, 1, +inf, +inf]
[2024-06-01 05:04:43] [INFO ] Invariant cache hit.
[2024-06-01 05:04:43] [INFO ] [Real]Absence check using 4 positive place invariants in 20 ms returned sat
[2024-06-01 05:04:43] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 263 ms returned sat
[2024-06-01 05:04:44] [INFO ] [Real]Absence check using state equation in 534 ms returned sat
[2024-06-01 05:04:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 30 ms returned sat
[2024-06-01 05:04:44] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2024-06-01 05:04:45] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-06-01 05:04:45] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2024-06-01 05:04:46] [INFO ] Added : 105 causal constraints over 21 iterations in 1133 ms. Result :sat
Minimization took 593 ms.
[2024-06-01 05:04:47] [INFO ] [Real]Absence check using 4 positive place invariants in 24 ms returned sat
[2024-06-01 05:04:47] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 268 ms returned sat
[2024-06-01 05:04:50] [INFO ] [Real]Absence check using state equation in 2730 ms returned sat
[2024-06-01 05:04:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:50] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-06-01 05:04:50] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 252 ms returned sat
[2024-06-01 05:04:52] [INFO ] [Nat]Absence check using state equation in 1811 ms returned sat
[2024-06-01 05:04:53] [INFO ] Deduced a trap composed of 6 places in 935 ms of which 99 ms to minimize.
[2024-06-01 05:04:54] [INFO ] Deduced a trap composed of 6 places in 860 ms of which 13 ms to minimize.
[2024-06-01 05:04:55] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 4 ms to minimize.
[2024-06-01 05:04:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2264 ms
[2024-06-01 05:04:55] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2024-06-01 05:04:55] [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 1
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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-06-01 05:04:55] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-06-01 05:04:55] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 242 ms returned sat
[2024-06-01 05:04:56] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2024-06-01 05:04:56] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2024-06-01 05:04:57] [INFO ] Added : 55 causal constraints over 11 iterations in 636 ms. Result :sat
Minimization took 662 ms.
[2024-06-01 05:04:58] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-06-01 05:04:58] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 250 ms returned sat
[2024-06-01 05:05:00] [INFO ] [Real]Absence check using state equation in 1558 ms returned sat
[2024-06-01 05:05:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:00] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-06-01 05:05:00] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 247 ms returned sat
[2024-06-01 05:05:01] [INFO ] [Nat]Absence check using state equation in 1001 ms returned sat
[2024-06-01 05:05:01] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2024-06-01 05:05:02] [INFO ] Added : 95 causal constraints over 19 iterations in 978 ms. Result :sat
Minimization took 581 ms.
[2024-06-01 05:05:03] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-06-01 05:05:03] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 254 ms returned sat
[2024-06-01 05:05:04] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2024-06-01 05:05:04] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2024-06-01 05:05:04] [INFO ] Added : 50 causal constraints over 10 iterations in 651 ms. Result :sat
Minimization took 667 ms.
[2024-06-01 05:05:05] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-06-01 05:05:06] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2024-06-01 05:05:06] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2024-06-01 05:05:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:06] [INFO ] [Nat]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-06-01 05:05:07] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 258 ms returned sat
[2024-06-01 05:05:08] [INFO ] [Nat]Absence check using state equation in 1215 ms returned sat
[2024-06-01 05:05:08] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 35 ms.
[2024-06-01 05:05:09] [INFO ] Added : 93 causal constraints over 19 iterations in 955 ms. Result :sat
Minimization took 569 ms.
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 255 ms returned sat
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using state equation in 438 ms returned unsat
[2024-06-01 05:05:10] [INFO ] [Real]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-06-01 05:05:11] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 260 ms returned sat
[2024-06-01 05:05:11] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2024-06-01 05:05:11] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2024-06-01 05:05:12] [INFO ] Added : 35 causal constraints over 7 iterations in 460 ms. Result :sat
Minimization took 648 ms.
[2024-06-01 05:05:13] [INFO ] [Real]Absence check using 4 positive place invariants in 17 ms returned sat
[2024-06-01 05:05:13] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 268 ms returned sat
[2024-06-01 05:05:14] [INFO ] [Real]Absence check using state equation in 734 ms returned unsat
[2024-06-01 05:05:14] [INFO ] [Real]Absence check using 4 positive place invariants in 15 ms returned sat
[2024-06-01 05:05:14] [INFO ] [Real]Absence check using 4 positive and 1607 generalized place invariants in 263 ms returned sat
[2024-06-01 05:05:15] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2024-06-01 05:05:15] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:15] [INFO ] [Nat]Absence check using 4 positive place invariants in 16 ms returned sat
[2024-06-01 05:05:15] [INFO ] [Nat]Absence check using 4 positive and 1607 generalized place invariants in 269 ms returned sat
[2024-06-01 05:05:16] [INFO ] [Nat]Absence check using state equation in 611 ms returned sat
[2024-06-01 05:05:16] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2024-06-01 05:05:16] [INFO ] Added : 48 causal constraints over 10 iterations in 546 ms. Result :sat
Minimization took 590 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 23, 0, 23, 0] Max Struct:[13, 529, 1, 23, 1, +inf, 23, 1, 23, +inf]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-13 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[13, 529, 1, 23, 1, +inf, 1, +inf]
Support contains 1108 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1917 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.11 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 117 transitions
Reduce isomorphic transitions removed 117 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 163 rules applied. Total rules applied 164 place count 1871 transition count 239
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 164 place count 1871 transition count 216
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 1 with 91 rules applied. Total rules applied 255 place count 1803 transition count 216
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 255 place count 1803 transition count 215
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 258 place count 1801 transition count 215
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 22 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 1 with 68 rules applied. Total rules applied 326 place count 1756 transition count 192
Applied a total of 326 rules in 265 ms. Remains 1756 /1966 variables (removed 210) and now considering 192/356 (removed 164) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 1756/1966 places, 192/356 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 192 rows 1756 cols
[2024-06-01 05:05:18] [INFO ] Computed 1565 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[13, 529, 1, 23, 1, +inf, 1, +inf]
RANDOM walk for 858794 steps (19394 resets) in 30001 ms. (28 steps per ms)
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-04 529 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-03 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1796476 steps (3017 resets) in 15003 ms. (119 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 529, 23] Max Struct:[23, +inf, +inf]
[2024-06-01 05:06:03] [INFO ] Invariant cache hit.
[2024-06-01 05:06:03] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 299 ms returned sat
[2024-06-01 05:06:04] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2024-06-01 05:06:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:06:04] [INFO ] [Nat]Absence check using 0 positive and 1565 generalized place invariants in 291 ms returned sat
[2024-06-01 05:06:04] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2024-06-01 05:06:05] [INFO ] Computed and/alt/rep : 121/122/121 causal constraints (skipped 70 transitions) in 28 ms.
[2024-06-01 05:06:05] [INFO ] Added : 55 causal constraints over 11 iterations in 525 ms. Result :sat
Minimization took 787 ms.
[2024-06-01 05:06:07] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 505 ms returned sat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using state equation in 2205 ms returned unsat
[2024-06-01 05:06:09] [INFO ] [Real]Absence check using 0 positive and 1565 generalized place invariants in 292 ms returned sat
[2024-06-01 05:06:10] [INFO ] [Real]Absence check using state equation in 383 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[17, 529, 23] Max Struct:[23, 529, 23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-15 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-10 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[23] Max Struct:[23]
Support contains 23 out of 1756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1756/1756 places, 192/192 transitions.
Graph (complete) has 15002 edges and 1756 vertex of which 1201 are kept as prefixes of interest. Removing 555 places using SCC suffix rule.2 ms
Discarding 555 places :
Also discarding 25 output transitions
Drop transitions (Output transitions of discarded places.) removed 25 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 1201 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 1199 transition count 140
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 30 place count 1199 transition count 117
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 69 rules applied. Total rules applied 99 place count 1153 transition count 117
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 1153 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 1152 transition count 116
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 4 with 552 rules applied. Total rules applied 653 place count 623 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 622 transition count 92
Ensure Unique test removed 23 places
Iterating post reduction 4 with 23 rules applied. Total rules applied 677 place count 599 transition count 92
Reduce places removed 23 places and 23 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 700 place count 576 transition count 69
Ensure Unique test removed 529 places
Iterating post reduction 5 with 529 rules applied. Total rules applied 1229 place count 47 transition count 69
Applied a total of 1229 rules in 118 ms. Remains 47 /1756 variables (removed 1709) and now considering 69/192 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 47/1756 places, 69/192 transitions.
// Phase 1: matrix 69 rows 47 cols
[2024-06-01 05:06:10] [INFO ] Computed 0 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[23] Max Struct:[23]
FORMULA QuasiCertifProtocol-COL-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (21276 resets) in 1419 ms. (704 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 4 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 91511 ms.
ITS solved all properties within timeout

BK_STOP 1717218371802

--------------------
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="QuasiCertifProtocol-COL-22"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-COL-22, 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 r520-tall-171662337700037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;