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-162038143800382.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-08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800382
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 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.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K 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 91K 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-08-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-08-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1620544534742

Running Version 0
[2021-05-09 07:15:36] [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 07:15:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:15:36] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2021-05-09 07:15:36] [INFO ] Transformed 393 places.
[2021-05-09 07:15:36] [INFO ] Transformed 344 transitions.
[2021-05-09 07:15:36] [INFO ] Found NUPN structural information;
[2021-05-09 07:15:36] [INFO ] Parsed PT model containing 393 places and 344 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 13 places in 4 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 90 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :2
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :2
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 7 properties.
// Phase 1: matrix 331 rows 380 cols
[2021-05-09 07:15:36] [INFO ] Computed 58 place invariants in 22 ms
[2021-05-09 07:15:36] [INFO ] [Real]Absence check using 44 positive place invariants in 13 ms returned sat
[2021-05-09 07:15:36] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-09 07:15:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using 44 positive place invariants in 16 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-09 07:15:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:37] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-09 07:15:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:37] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2021-05-09 07:15:37] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 3 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 1 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2021-05-09 07:15:38] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 559 ms
[2021-05-09 07:15:38] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 28 ms.
[2021-05-09 07:15:39] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2021-05-09 07:15:39] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:15:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2021-05-09 07:15:39] [INFO ] Added : 191 causal constraints over 40 iterations in 988 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-09 07:15:39] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:39] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-09 07:15:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:39] [INFO ] [Nat]Absence check using 44 positive place invariants in 12 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:39] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2021-05-09 07:15:39] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2021-05-09 07:15:39] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:15:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 166 ms
[2021-05-09 07:15:39] [INFO ] [Real]Absence check using 44 positive place invariants in 15 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 4 ms returned sat
[2021-05-09 07:15:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:40] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 96 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 86 places in 63 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:15:40] [INFO ] Deduced a trap composed of 44 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 53 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 65 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 71 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1233 ms
[2021-05-09 07:15:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:41] [INFO ] [Nat]Absence check using 44 positive place invariants in 11 ms returned sat
[2021-05-09 07:15:41] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:15:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:41] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 96 places in 72 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 3 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 86 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:15:41] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 46 places in 26 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 53 places in 28 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 58 places in 29 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 65 places in 31 ms of which 0 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Deduced a trap composed of 71 places in 31 ms of which 1 ms to minimize.
[2021-05-09 07:15:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1029 ms
[2021-05-09 07:15:42] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 30 ms.
[2021-05-09 07:15:43] [INFO ] Added : 196 causal constraints over 40 iterations in 598 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using 44 positive place invariants in 10 ms returned sat
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-09 07:15:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using 44 positive place invariants in 11 ms returned sat
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using 44 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-09 07:15:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:43] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 7 ms to minimize.
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2021-05-09 07:15:43] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 94 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 93 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 96 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 97 places in 59 ms of which 2 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 103 places in 58 ms of which 2 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 87 places in 57 ms of which 0 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 89 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 91 places in 52 ms of which 1 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:15:44] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 92 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 96 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 97 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 100 places in 50 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 96 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 95 places in 45 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 95 places in 46 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 96 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 90 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 98 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 97 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 93 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 92 places in 61 ms of which 1 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:45] [INFO ] Deduced a trap composed of 93 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 90 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 98 places in 43 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 101 places in 41 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 98 places in 41 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 89 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 93 places in 42 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 94 places in 40 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 90 places in 44 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 94 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 90 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 91 places in 48 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 91 places in 43 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 90 places in 63 ms of which 1 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 0 ms to minimize.
[2021-05-09 07:15:46] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 96 places in 59 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 94 places in 44 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 90 places in 52 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 88 places in 55 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 95 places in 54 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Trap strengthening (SAT) tested/added 60/59 trap constraints in 3891 ms
[2021-05-09 07:15:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:47] [INFO ] [Nat]Absence check using 44 positive place invariants in 16 ms returned sat
[2021-05-09 07:15:47] [INFO ] [Nat]Absence check using 44 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-09 07:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 07:15:47] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 95 places in 51 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 07:15:47] [INFO ] Deduced a trap composed of 94 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 100 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 40 places in 47 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 96 places in 50 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 97 places in 65 ms of which 1 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 1 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 90 places in 62 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 0 ms to minimize.
[2021-05-09 07:15:48] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1435 ms
[2021-05-09 07:15:48] [INFO ] Computed and/alt/rep : 305/374/305 causal constraints (skipped 25 transitions) in 22 ms.
[2021-05-09 07:15:49] [INFO ] Added : 238 causal constraints over 48 iterations in 816 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 3 different solutions.
Incomplete Parikh walk after 17600 steps, including 112 resets, run finished after 43 ms. (steps per millisecond=409 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 29300 steps, including 142 resets, run finished after 61 ms. (steps per millisecond=480 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 19200 steps, including 137 resets, run finished after 34 ms. (steps per millisecond=564 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 5 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Graph (trivial) has 237 edges and 380 vertex of which 8 / 380 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 724 edges and 373 vertex of which 364 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 96 rules applied. Total rules applied 98 place count 364 transition count 224
Reduce places removed 95 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 96 rules applied. Total rules applied 194 place count 269 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 195 place count 268 transition count 223
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 195 place count 268 transition count 177
Deduced a syphon composed of 46 places in 2 ms
Ensure Unique test removed 10 places
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 297 place count 212 transition count 177
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 361 place count 148 transition count 113
Iterating global reduction 3 with 64 rules applied. Total rules applied 425 place count 148 transition count 113
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 425 place count 148 transition count 106
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 442 place count 138 transition count 106
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 548 place count 85 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 549 place count 84 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 550 place count 83 transition count 52
Applied a total of 550 rules in 72 ms. Remains 83 /380 variables (removed 297) and now considering 52/331 (removed 279) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/380 places, 52/331 transitions.
[2021-05-09 07:15:50] [INFO ] Flatten gal took : 26 ms
[2021-05-09 07:15:50] [INFO ] Flatten gal took : 8 ms
[2021-05-09 07:15:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5895097485133801189.gal : 5 ms
[2021-05-09 07:15:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2134731375947354842.prop : 0 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/ReachabilityCardinality5895097485133801189.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2134731375947354842.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/ReachabilityCardinality5895097485133801189.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2134731375947354842.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2134731375947354842.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 23
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :23 after 56
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,137,0.028313,4600,2,788,10,2732,7,0,389,2487,0
Total reachable state count : 137

Verifying 1 reachability properties.
Reachability property BusinessProcesses-PT-08-ReachabilityCardinality-14 does not hold.
FORMULA BusinessProcesses-PT-08-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
No reachable states exhibit your property : BusinessProcesses-PT-08-ReachabilityCardinality-14

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-08-ReachabilityCardinality-14,0,0.028854,4864,1,0,10,2732,7,0,393,2487,0
All properties solved without resorting to model-checking.

BK_STOP 1620544550378

--------------------
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-08"
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-08, 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-162038143800382"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-08.tgz
mv BusinessProcesses-PT-08 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 ;