fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r263-smll-167863538300501
Last Updated
May 14, 2023

About the Execution of LoLa+red for PermAdmissibility-COL-50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
243.871 10243.00 18903.00 452.80 50 100 50 50 100 50 100 100 50 100 50 100 50 50 100 50 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538300501.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 lolaxred
Input is PermAdmissibility-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538300501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.6K Feb 26 01:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 01:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 01:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 01:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 01:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Feb 26 01:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 54K Mar 5 18:23 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 PermAdmissibility-COL-50-UpperBounds-00
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-01
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-02
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-03
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-04
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-05
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-06
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-07
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-08
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-09
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-10
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-11
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-12
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-13
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-14
FORMULA_NAME PermAdmissibility-COL-50-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678804428903

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=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-50
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:33:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-14 14:33:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:33:52] [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-14 14:33:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 14:33:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1129 ms
[2023-03-14 14:33:53] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
[2023-03-14 14:33:53] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 27 ms.
[2023-03-14 14:33:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
// Phase 1: matrix 16 rows 40 cols
[2023-03-14 14:33:53] [INFO ] Computed 24 place invariants in 9 ms
[2023-03-14 14:33:53] [INFO ] Invariant cache hit.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 29 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-14 14:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:54] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-14 14:33:54] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-14 14:33:54] [INFO ] Added : 11 causal constraints over 3 iterations in 56 ms. Result :sat
Minimization took 43 ms.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-14 14:33:54] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 14:33:54] [INFO ] Added : 11 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 21 ms.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-14 14:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:54] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-14 14:33:54] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-14 14:33:54] [INFO ] Added : 15 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 17 ms.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:54] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-14 14:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:54] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 26 ms returned sat
[2023-03-14 14:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-14 14:33:55] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-14 14:33:55] [INFO ] Added : 14 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 16 ms.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-14 14:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-14 14:33:55] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 14:33:55] [INFO ] Added : 15 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 17 ms.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-14 14:33:55] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 14:33:55] [INFO ] Added : 11 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 20 ms.
[2023-03-14 14:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-14 14:33:55] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 14:33:55] [INFO ] Added : 11 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 19 ms.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-14 14:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-14 14:33:55] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 14:33:55] [INFO ] Added : 14 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 16 ms.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-14 14:33:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-14 14:33:56] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-14 14:33:56] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 25 ms.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-14 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-14 14:33:56] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 14:33:56] [INFO ] Added : 11 causal constraints over 3 iterations in 28 ms. Result :sat
Minimization took 19 ms.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-14 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-14 14:33:56] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 14:33:56] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 14 ms.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-14 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-14 14:33:56] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 14:33:56] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
Minimization took 14 ms.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-14 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-14 14:33:56] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 14:33:56] [INFO ] Added : 11 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 27 ms.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-14 14:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:56] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-14 14:33:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 14:33:57] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-14 14:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 14:33:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-14 14:33:57] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-14 14:33:57] [INFO ] Added : 13 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, 100, -1, -1, 100, -1, -1, -1, 100, -1, -1, -1, -1]
FORMULA PermAdmissibility-COL-50-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-50-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-50-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2023-03-14 14:33:57] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 16 ms.
[2023-03-14 14:33:57] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Incomplete random walk after 10008 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :850
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :458
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :205
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :183
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :182
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :173
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :169
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :477
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :390
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :202
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :278
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :470
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :181
[2023-03-14 14:33:57] [INFO ] Invariant cache hit.
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 10 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned unsat
[2023-03-14 14:33:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned unsat
Current structural bounds on expressions (after SMT) : [50, 100, 50, 50, 50, 100, 50, 100, 50, 50, 50, 100, 50] Max seen :[50, 100, 50, 50, 50, 100, 50, 100, 50, 50, 50, 100, 50]
FORMULA PermAdmissibility-COL-50-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-13 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-10 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-03 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-50-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5634 ms.
ITS solved all properties within timeout

BK_STOP 1678804439146

--------------------
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="PermAdmissibility-COL-50"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is PermAdmissibility-COL-50, 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 r263-smll-167863538300501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-50.tgz
mv PermAdmissibility-COL-50 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 ;