fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r140-tall-162089128000491
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PermAdmissibility-COL-20

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
230.819 24348.00 11536.00 14928.50 40 20 20 40 40 40 20 20 20 40 40 20 40 40 20 40 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089128000491.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-COL-20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128000491
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 08:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 54K May 5 16:51 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-20-UpperBounds-00
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-01
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-02
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-03
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-04
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-05
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-06
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-07
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-08
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-09
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-10
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-11
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-12
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-13
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-14
FORMULA_NAME PermAdmissibility-COL-20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620991476317

Running Version 0
[2021-05-14 11:24:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-14 11:24:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 11:24:57] [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.
[2021-05-14 11:24:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 11:24:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 569 ms
[2021-05-14 11:24:57] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2021-05-14 11:24:57] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions in 4 ms.
[2021-05-14 11:24:57] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_614108422382905896.dot
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 11:24:57] [INFO ] Computed 24 place invariants in 5 ms
[2021-05-14 11:24:57] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 12 ms.
[2021-05-14 11:24:57] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 16 rows 40 cols
[2021-05-14 11:24:57] [INFO ] Computed 24 place invariants in 6 ms
[2021-05-14 11:24:57] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 11:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:57] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-14 11:24:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:57] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 7 ms returned sat
[2021-05-14 11:24:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-14 11:24:57] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 11:24:57] [INFO ] Added : 10 causal constraints over 2 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:24:58] [INFO ] Added : 15 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 11:24:58] [INFO ] Added : 14 causal constraints over 3 iterations in 20 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 17 ms. Result :sat
Minimization took 8 ms.
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 11 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-14 11:24:58] [INFO ] Added : 12 causal constraints over 3 iterations in 17 ms. Result :sat
Minimization took 9 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned unsat
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:24:58] [INFO ] Added : 14 causal constraints over 3 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:24:58] [INFO ] Added : 15 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 5 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 12 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned unsat
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 6 ms returned unsat
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 11 causal constraints over 3 iterations in 11 ms. Result :sat
Minimization took 6 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 13 ms.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 2 ms returned unsat
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 11:24:58] [INFO ] Added : 10 causal constraints over 2 iterations in 14 ms. Result :sat
Minimization took 7 ms.
[2021-05-14 11:24:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 4 ms returned sat
[2021-05-14 11:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 11:24:58] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-14 11:24:58] [INFO ] Computed and/alt/rep : 15/39/15 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 11:24:59] [INFO ] Added : 10 causal constraints over 2 iterations in 16 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, 40, -1, -1, -1, 40, 40, -1, -1, -1, 20, -1]
FORMULA PermAdmissibility-COL-20-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-20-UpperBounds-10 40 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-20-UpperBounds-09 40 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
FORMULA PermAdmissibility-COL-20-UpperBounds-05 40 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-14 11:24:59] [INFO ] Unfolded HLPN to a Petri net with 208 places and 1024 transitions in 5 ms.
[2021-05-14 11:24:59] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_7281827641867886499.dot
Deduced a syphon composed of 40 places in 4 ms
Reduce places removed 40 places and 432 transitions.
Incomplete random walk after 10014 steps, including 29 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 12) seen :360
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 12) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :63
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :57
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :54
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 12) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :58
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :66
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :65
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :73
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :58
// Phase 1: matrix 592 rows 168 cols
[2021-05-14 11:24:59] [INFO ] Computed 32 place invariants in 32 ms
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 11 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 9 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 10 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 10 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 7 ms returned unsat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-05-14 11:24:59] [INFO ] [Real]Absence check using 2 positive and 30 generalized place invariants in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : [40, 20, 20, 40, 40, 20, 20, 20, 20, 40, 40, 40] Max seen :[40, 20, 20, 40, 40, 20, 20, 20, 20, 40, 40, 40]
FORMULA PermAdmissibility-COL-20-UpperBounds-15 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-13 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-12 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-04 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-03 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PermAdmissibility-COL-20-UpperBounds-00 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620991500665

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-20"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-20, 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 r140-tall-162089128000491"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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