fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r159-oct2-162089268300395
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for PolyORBNT-COL-S05J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
327.544 12744.00 24812.00 152.40 1 10 5 3 1 1 3 2 1 1 1 1 1 2 5 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r159-oct2-162089268300395.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-oct2-162089268300395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 86K 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.9K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 09:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 09:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 12:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 12:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:13 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 94K 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 PolyORBNT-COL-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621214835182

Running Version 0
[2021-05-17 01:27:18] [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-17 01:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 01:27:18] [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-17 01:27:18] [WARNING] Using fallBack plugin, rng conformance not checked
[2021-05-17 01:27:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 648 ms
[2021-05-17 01:27:19] [INFO ] ms1 symmetric to ms4 in transition trans_489
[2021-05-17 01:27:19] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-17 01:27:19] [INFO ] ms2 symmetric to ms3 in transition trans_489
[2021-05-17 01:27:19] [INFO ] ms1 symmetric to ms2 in transition trans_488
[2021-05-17 01:27:19] [INFO ] ms2 symmetric to ms3 in transition trans_488
[2021-05-17 01:27:19] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-17 01:27:19] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 156 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
[2021-05-17 01:27:19] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions in 3 ms.
[2021-05-17 01:27:19] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_8252381348002534122.dot
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:27:19] [INFO ] Computed 13 place invariants in 12 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2021-05-17 01:27:19] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 1775 transitions in 24 ms.
[2021-05-17 01:27:19] [INFO ] Unfolded HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2021-05-17 01:27:19] [INFO ] Computed 13 place invariants in 11 ms
[2021-05-17 01:27:19] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2021-05-17 01:27:19] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2021-05-17 01:27:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-17 01:27:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:19] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2021-05-17 01:27:19] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:19] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 01:27:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 01:27:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:20] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 3 ms to minimize.
[2021-05-17 01:27:20] [INFO ] Deduced a trap composed of 17 places in 582 ms of which 1 ms to minimize.
[2021-05-17 01:27:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 721 ms
[2021-05-17 01:27:20] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-17 01:27:20] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2021-05-17 01:27:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2021-05-17 01:27:20] [INFO ] Added : 36 causal constraints over 8 iterations in 250 ms. Result :sat
Minimization took 39 ms.
[2021-05-17 01:27:20] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:20] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:20] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using 6 positive place invariants in 54 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 30 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2021-05-17 01:27:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 11 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:21] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2021-05-17 01:27:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2021-05-17 01:27:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 11 ms.
[2021-05-17 01:27:21] [INFO ] Added : 21 causal constraints over 5 iterations in 126 ms. Result :sat
Minimization took 13 ms.
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using 6 positive place invariants in 16 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:21] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-17 01:27:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 24 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:21] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-17 01:27:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:21] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:27:22] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2021-05-17 01:27:22] [INFO ] Deduced a trap composed of 25 places in 15 ms of which 1 ms to minimize.
[2021-05-17 01:27:22] [INFO ] Deduced a trap composed of 11 places in 13 ms of which 0 ms to minimize.
[2021-05-17 01:27:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2021-05-17 01:27:22] [INFO ] Added : 36 causal constraints over 8 iterations in 244 ms. Result :sat
Minimization took 23 ms.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive place invariants in 21 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 01:27:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2021-05-17 01:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2021-05-17 01:27:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:27:22] [INFO ] Added : 22 causal constraints over 5 iterations in 97 ms. Result :sat
Minimization took 44 ms.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive place invariants in 52 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 53 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-17 01:27:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:22] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2021-05-17 01:27:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2021-05-17 01:27:22] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 01:27:22] [INFO ] Added : 19 causal constraints over 4 iterations in 33 ms. Result :sat
Minimization took 15 ms.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:22] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-17 01:27:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:27:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 14 ms.
[2021-05-17 01:27:23] [INFO ] Added : 36 causal constraints over 8 iterations in 57 ms. Result :sat
Minimization took 15 ms.
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-17 01:27:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:23] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2021-05-17 01:27:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2021-05-17 01:27:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2021-05-17 01:27:23] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:27:23] [INFO ] Added : 36 causal constraints over 8 iterations in 37 ms. Result :sat
Minimization took 12 ms.
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:23] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:23] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 01:27:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:27:23] [INFO ] Deduced a trap composed of 17 places in 438 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 672 ms
[2021-05-17 01:27:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:27:24] [INFO ] Added : 33 causal constraints over 7 iterations in 157 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-17 01:27:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 23 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2021-05-17 01:27:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:27:24] [INFO ] Deduced a trap composed of 25 places in 16 ms of which 1 ms to minimize.
[2021-05-17 01:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2021-05-17 01:27:24] [INFO ] Added : 36 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 14 ms.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-17 01:27:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:24] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2021-05-17 01:27:24] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-17 01:27:24] [INFO ] Added : 36 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 31 ms.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2021-05-17 01:27:25] [INFO ] Deduced a trap composed of 14 places in 516 ms of which 1 ms to minimize.
[2021-05-17 01:27:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 525 ms
[2021-05-17 01:27:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 01:27:25] [INFO ] Added : 19 causal constraints over 4 iterations in 24 ms. Result :sat
Minimization took 16 ms.
[2021-05-17 01:27:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-17 01:27:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 01:27:25] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2021-05-17 01:27:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2021-05-17 01:27:25] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-17 01:27:25] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2021-05-17 01:27:25] [INFO ] Deduced a trap composed of 25 places in 12 ms of which 0 ms to minimize.
[2021-05-17 01:27:25] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 0 ms to minimize.
[2021-05-17 01:27:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 68 ms
[2021-05-17 01:27:25] [INFO ] Added : 36 causal constraints over 8 iterations in 180 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [1, 10, 3, 1, 3, 2, -1, -1, 1, 1, -1, 2, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-01 10 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
[2021-05-17 01:27:25] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 1775 transitions in 12 ms.
[2021-05-17 01:27:25] [INFO ] Unfolded HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1001_18027025825038823496.dot
Deduced a syphon composed of 80 places in 8 ms
Reduce places removed 80 places and 80 transitions.
Incomplete random walk after 10000 steps, including 690 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 12) seen :14
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 256 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :7
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2021-05-17 01:27:26] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2021-05-17 01:27:26] [INFO ] Computed 182 place invariants in 226 ms
[2021-05-17 01:27:26] [INFO ] [Real]Absence check using 175 positive place invariants in 59 ms returned sat
[2021-05-17 01:27:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
[2021-05-17 01:27:26] [INFO ] [Real]Absence check using 175 positive place invariants in 42 ms returned sat
[2021-05-17 01:27:26] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
[2021-05-17 01:27:27] [INFO ] [Real]Absence check using 175 positive place invariants in 63 ms returned sat
[2021-05-17 01:27:27] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 19 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[1, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621214847926

--------------------
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="PolyORBNT-COL-S05J80"
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 PolyORBNT-COL-S05J80, 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 r159-oct2-162089268300395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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