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

About the Execution of ITS-Tools for Peterson-COL-3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
266.991 7986.00 15362.00 418.00 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 3 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-162089128100563.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 Peterson-COL-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128100563
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 372K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.6K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 43K 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 Peterson-COL-3-UpperBounds-00
FORMULA_NAME Peterson-COL-3-UpperBounds-01
FORMULA_NAME Peterson-COL-3-UpperBounds-02
FORMULA_NAME Peterson-COL-3-UpperBounds-03
FORMULA_NAME Peterson-COL-3-UpperBounds-04
FORMULA_NAME Peterson-COL-3-UpperBounds-05
FORMULA_NAME Peterson-COL-3-UpperBounds-06
FORMULA_NAME Peterson-COL-3-UpperBounds-07
FORMULA_NAME Peterson-COL-3-UpperBounds-08
FORMULA_NAME Peterson-COL-3-UpperBounds-09
FORMULA_NAME Peterson-COL-3-UpperBounds-10
FORMULA_NAME Peterson-COL-3-UpperBounds-11
FORMULA_NAME Peterson-COL-3-UpperBounds-12
FORMULA_NAME Peterson-COL-3-UpperBounds-13
FORMULA_NAME Peterson-COL-3-UpperBounds-14
FORMULA_NAME Peterson-COL-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621007395865

Running Version 0
[2021-05-14 15:49: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 15:49:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 15:49: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 15:49:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-14 15:49:58] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 537 ms
[2021-05-14 15:49:58] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 256 PT places and 396.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
[2021-05-14 15:49:58] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2021-05-14 15:49:58] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_10089389334590096838.dot
Reduce places removed 2 places and 0 transitions.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:49:58] [INFO ] Computed 1 place invariants in 4 ms
FORMULA Peterson-COL-3-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA Peterson-COL-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-14 15:49:58] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 24 ms.
[2021-05-14 15:49:58] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 14 rows 9 cols
[2021-05-14 15:49:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 6 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 4 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 4 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:58] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-14 15:49:58] [INFO ] Computed and/alt/rep : 13/21/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-14 15:49:58] [INFO ] Added : 11 causal constraints over 4 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]
[2021-05-14 15:49:58] [INFO ] Unfolded HLPN to a Petri net with 256 places and 356 transitions in 5 ms.
[2021-05-14 15:49:58] [INFO ] Unfolded HLPN properties in 1 ms.
Successfully produced net in file /tmp/petri1001_10916604074818145293.dot
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :34
FORMULA Peterson-COL-3-UpperBounds-14 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :13
FORMULA Peterson-COL-3-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Peterson-COL-3-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :4
[2021-05-14 15:49:58] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 15:49:58] [INFO ] Computed 15 place invariants in 15 ms
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 15:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:59] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2021-05-14 15:49:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:49:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:49:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:49:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:49:59] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2021-05-14 15:49:59] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 15:49:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2021-05-14 15:49:59] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 4 ms to minimize.
[2021-05-14 15:49:59] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2021-05-14 15:49:59] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2021-05-14 15:49:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 255 ms
[2021-05-14 15:49:59] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 22 ms.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 38 places in 62 ms of which 0 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 38 places in 65 ms of which 0 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:50:00] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 14 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 0 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 914 ms
[2021-05-14 15:50:01] [INFO ] Added : 235 causal constraints over 47 iterations in 1778 ms. Result :sat
Minimization took 104 ms.
[2021-05-14 15:50:01] [INFO ] [Real]Absence check using 11 positive place invariants in 21 ms returned sat
[2021-05-14 15:50:01] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 15:50:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 15:50:01] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-14 15:50:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 15:50:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 15:50:01] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 15:50:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 15:50:01] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2021-05-14 15:50:01] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 0 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2021-05-14 15:50:01] [INFO ] Deduced a trap composed of 52 places in 55 ms of which 1 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 84 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 1 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 0 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2021-05-14 15:50:02] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 12 trap constraints in 808 ms
Current structural bounds on expressions (after SMT) : [4, 3] Max seen :[2, 3]
FORMULA Peterson-COL-3-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 69600 steps, including 910 resets, run finished after 268 ms. (steps per millisecond=259 ) properties (out of 1) seen :4 could not realise parikh vector
FORMULA Peterson-COL-3-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621007403851

--------------------
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="Peterson-COL-3"
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 Peterson-COL-3, 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-162089128100563"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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