fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143700334
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
276.928 12888.00 26425.00 70.00 TTTFFFFTTFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143700334.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143700334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 59K 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 booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620542439270

Running Version 0
[2021-05-09 06:40:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-09 06:40:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:40:41] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2021-05-09 06:40:41] [INFO ] Transformed 262 places.
[2021-05-09 06:40:41] [INFO ] Transformed 219 transitions.
[2021-05-09 06:40:41] [INFO ] Found NUPN structural information;
[2021-05-09 06:40:41] [INFO ] Parsed PT model containing 262 places and 219 transitions in 100 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 136 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :5
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 204 rows 245 cols
[2021-05-09 06:40:41] [INFO ] Computed 43 place invariants in 20 ms
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using 30 positive place invariants in 21 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:41] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:40:41] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 2 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 400 ms
[2021-05-09 06:40:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:42] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:40:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 318 ms
[2021-05-09 06:40:42] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2021-05-09 06:40:42] [INFO ] Added : 124 causal constraints over 25 iterations in 326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-09 06:40:42] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2021-05-09 06:40:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2021-05-09 06:40:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 10 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:43] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2021-05-09 06:40:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:43] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:43] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 0 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 59 places in 51 ms of which 0 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 5 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:40:43] [INFO ] Deduced a trap composed of 61 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 672 ms
[2021-05-09 06:40:44] [INFO ] [Real]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 06:40:44] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2021-05-09 06:40:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:44] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-09 06:40:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:44] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2021-05-09 06:40:44] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2021-05-09 06:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:44] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 56 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 0 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2021-05-09 06:40:44] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 5 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 33 places in 196 ms of which 0 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2021-05-09 06:40:45] [INFO ] Deduced a trap composed of 55 places in 81 ms of which 1 ms to minimize.
[2021-05-09 06:40:46] [INFO ] Deduced a trap composed of 56 places in 495 ms of which 0 ms to minimize.
[2021-05-09 06:40:46] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:40:46] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 30 places in 1194 ms of which 5 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 61 places in 42 ms of which 1 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 63 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 65 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 14 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Deduced a trap composed of 60 places in 33 ms of which 0 ms to minimize.
[2021-05-09 06:40:47] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 3367 ms
[2021-05-09 06:40:47] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2021-05-09 06:40:48] [INFO ] Added : 123 causal constraints over 25 iterations in 355 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:40:48] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2021-05-09 06:40:48] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:48] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 06:40:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:48] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2021-05-09 06:40:48] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:48] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 1 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 7 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2021-05-09 06:40:48] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 61 places in 40 ms of which 2 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 2 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 7 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 0 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 70 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:40:49] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 924 ms
[2021-05-09 06:40:49] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 26 ms.
[2021-05-09 06:40:49] [INFO ] Added : 134 causal constraints over 27 iterations in 386 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:40:49] [INFO ] [Real]Absence check using 30 positive place invariants in 8 ms returned sat
[2021-05-09 06:40:49] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 2 ms returned sat
[2021-05-09 06:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:49] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 06:40:49] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 277 ms
[2021-05-09 06:40:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:40:50] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2021-05-09 06:40:50] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2021-05-09 06:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:40:50] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2021-05-09 06:40:50] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 290 ms
[2021-05-09 06:40:50] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 15 ms.
[2021-05-09 06:40:51] [INFO ] Added : 149 causal constraints over 30 iterations in 409 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 13600 steps, including 227 resets, run finished after 27 ms. (steps per millisecond=503 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 204 resets, run finished after 27 ms. (steps per millisecond=496 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 228 resets, run finished after 25 ms. (steps per millisecond=588 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14500 steps, including 232 resets, run finished after 29 ms. (steps per millisecond=500 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 22 out of 245 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 118 edges and 245 vertex of which 4 / 245 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 442 edges and 242 vertex of which 235 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 235 transition count 155
Reduce places removed 42 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 193 transition count 150
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 188 transition count 150
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 96 place count 188 transition count 118
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 164 place count 152 transition count 118
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 188 place count 128 transition count 94
Iterating global reduction 3 with 24 rules applied. Total rules applied 212 place count 128 transition count 94
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 280 place count 93 transition count 61
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 281 place count 93 transition count 60
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 282 place count 92 transition count 60
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 283 place count 92 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 91 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 285 place count 90 transition count 59
Applied a total of 285 rules in 114 ms. Remains 90 /245 variables (removed 155) and now considering 59/204 (removed 145) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/245 places, 59/204 transitions.
[2021-05-09 06:40:51] [INFO ] Flatten gal took : 50 ms
[2021-05-09 06:40:51] [INFO ] Flatten gal took : 16 ms
[2021-05-09 06:40:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1469834156487187491.gal : 15 ms
[2021-05-09 06:40:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8997371561679012060.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality1469834156487187491.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8997371561679012060.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality1469834156487187491.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8997371561679012060.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8997371561679012060.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 7
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 117
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :117 after 493
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3230 after 3910
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3910 after 8062
Reachability property BusinessProcesses-PT-02-ReachabilityCardinality-15 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property BusinessProcesses-PT-02-ReachabilityCardinality-09 does not hold.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :8062 after 11254
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,36542,0.16571,7184,2,2982,16,11912,8,0,425,7329,0
Total reachable state count : 36542

Verifying 4 reachability properties.
Reachability property BusinessProcesses-PT-02-ReachabilityCardinality-01 is true.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityCardinality-01,240,0.166369,7184,2,356,16,11912,8,0,427,7329,0
Invariant property BusinessProcesses-PT-02-ReachabilityCardinality-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityCardinality-09,48,0.1686,7448,2,178,16,11912,9,0,449,7329,0
Invariant property BusinessProcesses-PT-02-ReachabilityCardinality-10 does not hold.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityCardinality-10,864,0.171051,7448,2,314,16,11912,9,0,457,7329,0
Reachability property BusinessProcesses-PT-02-ReachabilityCardinality-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BusinessProcesses-PT-02-ReachabilityCardinality-15,42,0.17351,7448,2,253,16,11912,10,0,477,7329,0
All properties solved without resorting to model-checking.

BK_STOP 1620542452158

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="BusinessProcesses-PT-02"
export BK_EXAMINATION="ReachabilityCardinality"
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 BusinessProcesses-PT-02, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r026-tajo-162038143700334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-02.tgz
mv BusinessProcesses-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;