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

About the Execution of ITS-Tools for Philosophers-COL-000020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
234.880 7925.00 17218.00 339.60 20 20 20 20 20 20 20 20 10 20 20 20 20 20 10 10 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-162298995800011.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Philosophers-COL-000020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995800011
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.1K Mar 28 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 08:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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 Philosophers-COL-000020-UpperBounds-00
FORMULA_NAME Philosophers-COL-000020-UpperBounds-01
FORMULA_NAME Philosophers-COL-000020-UpperBounds-02
FORMULA_NAME Philosophers-COL-000020-UpperBounds-03
FORMULA_NAME Philosophers-COL-000020-UpperBounds-04
FORMULA_NAME Philosophers-COL-000020-UpperBounds-05
FORMULA_NAME Philosophers-COL-000020-UpperBounds-06
FORMULA_NAME Philosophers-COL-000020-UpperBounds-07
FORMULA_NAME Philosophers-COL-000020-UpperBounds-08
FORMULA_NAME Philosophers-COL-000020-UpperBounds-09
FORMULA_NAME Philosophers-COL-000020-UpperBounds-10
FORMULA_NAME Philosophers-COL-000020-UpperBounds-11
FORMULA_NAME Philosophers-COL-000020-UpperBounds-12
FORMULA_NAME Philosophers-COL-000020-UpperBounds-13
FORMULA_NAME Philosophers-COL-000020-UpperBounds-14
FORMULA_NAME Philosophers-COL-000020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1622990157493

Running Version 0
[2021-06-06 14:36:00] [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-06-06 14:36:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 14:36:00] [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-06-06 14:36:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-06-06 14:36:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 788 ms
[2021-06-06 14:36:01] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 100 PT places and 100.0 transition bindings in 59 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2021-06-06 14:36:01] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions in 3 ms.
[2021-06-06 14:36:01] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_4792859067809185563.dot
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:36:01] [INFO ] Computed 2 place invariants in 5 ms
FORMULA Philosophers-COL-000020-UpperBounds-12 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-02 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Philosophers-COL-000020-UpperBounds-01 20 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-06-06 14:36:01] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions in 5 ms.
[2021-06-06 14:36:01] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 5 rows 5 cols
[2021-06-06 14:36:01] [INFO ] Computed 2 place invariants in 1 ms
[2021-06-06 14:36:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2021-06-06 14:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-06-06 14:36:01] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-06-06 14:36:01] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2021-06-06 14:36:01] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Minimization took 17 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 4 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 5 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 3 ms.
[2021-06-06 14:36:02] [INFO ] Added : 1 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 4 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 12 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 0 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 1 ms.
[2021-06-06 14:36:02] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 4 ms.
[2021-06-06 14:36:02] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 6 ms.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-06-06 14:36:02] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-06-06 14:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-06-06 14:36:02] [INFO ] Computed and/alt/rep : 3/4/3 causal constraints (skipped 0 transitions) in 2 ms.
[2021-06-06 14:36:02] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [20, 20, 20, 20, 20, 10, 20, 20, 20, 10, 10]
[2021-06-06 14:36:02] [INFO ] Unfolded HLPN to a Petri net with 100 places and 100 transitions in 3 ms.
[2021-06-06 14:36:02] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_4863602704033983799.dot
Incomplete random walk after 10000 steps, including 16 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 11) seen :178
FORMULA Philosophers-COL-000020-UpperBounds-13 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-09 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-06 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-04 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Philosophers-COL-000020-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :27
// Phase 1: matrix 100 rows 100 cols
[2021-06-06 14:36:03] [INFO ] Computed 40 place invariants in 12 ms
[2021-06-06 14:36:03] [INFO ] [Real]Absence check using 40 positive place invariants in 35 ms returned sat
[2021-06-06 14:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:03] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-06-06 14:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2021-06-06 14:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:03] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-06-06 14:36:03] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 8 ms.
[2021-06-06 14:36:03] [INFO ] Added : 10 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 20 ms.
[2021-06-06 14:36:03] [INFO ] [Real]Absence check using 40 positive place invariants in 62 ms returned sat
[2021-06-06 14:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:03] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2021-06-06 14:36:03] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:03] [INFO ] [Nat]Absence check using 40 positive place invariants in 41 ms returned sat
[2021-06-06 14:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:03] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-06-06 14:36:03] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 16 ms.
[2021-06-06 14:36:03] [INFO ] Added : 10 causal constraints over 2 iterations in 60 ms. Result :sat
Minimization took 20 ms.
[2021-06-06 14:36:03] [INFO ] [Real]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-06-06 14:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:04] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2021-06-06 14:36:04] [INFO ] Solution in real domain found non-integer solution.
[2021-06-06 14:36:04] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2021-06-06 14:36:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-06-06 14:36:04] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-06-06 14:36:04] [INFO ] Computed and/alt/rep : 60/80/60 causal constraints (skipped 0 transitions) in 25 ms.
[2021-06-06 14:36:04] [INFO ] Added : 10 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [10, 10, 10] Max seen :[9, 9, 9]
Incomplete Parikh walk after 5000 steps, including 174 resets, run finished after 48 ms. (steps per millisecond=104 ) properties (out of 3) seen :27 could not realise parikh vector
Incomplete Parikh walk after 5000 steps, including 177 resets, run finished after 37 ms. (steps per millisecond=135 ) properties (out of 3) seen :27 could not realise parikh vector
Incomplete Parikh walk after 5000 steps, including 177 resets, run finished after 35 ms. (steps per millisecond=142 ) properties (out of 3) seen :30 could not realise parikh vector
FORMULA Philosophers-COL-000020-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000020-UpperBounds-14 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Philosophers-COL-000020-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1622990165418

--------------------
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="Philosophers-COL-000020"
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 Philosophers-COL-000020, 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-162298995800011"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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