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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.5K Mar 28 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K Mar 28 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K 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 63K 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-03-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-03-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620542529360

Running Version 0
[2021-05-09 06:42:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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:42:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 06:42:11] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2021-05-09 06:42:11] [INFO ] Transformed 274 places.
[2021-05-09 06:42:11] [INFO ] Transformed 237 transitions.
[2021-05-09 06:42:11] [INFO ] Found NUPN structural information;
[2021-05-09 06:42:11] [INFO ] Parsed PT model containing 274 places and 237 transitions in 103 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 1 transitions.
Incomplete random walk after 10000 steps, including 115 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :8
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :1
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 236 rows 273 cols
[2021-05-09 06:42:11] [INFO ] Computed 43 place invariants in 21 ms
[2021-05-09 06:42:11] [INFO ] [Real]Absence check using 31 positive place invariants in 9 ms returned unsat
[2021-05-09 06:42:12] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2021-05-09 06:42:12] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-09 06:42:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:12] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-09 06:42:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:42:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 13 ms returned sat
[2021-05-09 06:42:12] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 5 ms returned sat
[2021-05-09 06:42:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:12] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 8 places in 94 ms of which 5 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 50 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:42:12] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 517 ms
[2021-05-09 06:42:12] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 15 ms.
[2021-05-09 06:42:13] [INFO ] Added : 143 causal constraints over 29 iterations in 440 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-09 06:42:13] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2021-05-09 06:42:13] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 06:42:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:13] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 0 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2021-05-09 06:42:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 399 ms
[2021-05-09 06:42:13] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned unsat
[2021-05-09 06:42:13] [INFO ] [Real]Absence check using 31 positive place invariants in 8 ms returned unsat
[2021-05-09 06:42:14] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2021-05-09 06:42:14] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 06:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:14] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2021-05-09 06:42:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 06:42:14] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2021-05-09 06:42:14] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-09 06:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:14] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 41 places in 40 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 46 places in 29 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 49 places in 28 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 36 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Deduced a trap composed of 46 places in 27 ms of which 1 ms to minimize.
[2021-05-09 06:42:14] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 706 ms
[2021-05-09 06:42:14] [INFO ] Computed and/alt/rep : 216/267/216 causal constraints (skipped 19 transitions) in 19 ms.
[2021-05-09 06:42:15] [INFO ] Added : 119 causal constraints over 24 iterations in 373 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 2 ms.
[2021-05-09 06:42:15] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-09 06:42:15] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 4 ms returned sat
[2021-05-09 06:42:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 06:42:15] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 6 ms to minimize.
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 72 places in 46 ms of which 0 ms to minimize.
[2021-05-09 06:42:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 73 places in 59 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 69 places in 51 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 74 places in 42 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2021-05-09 06:42:16] [INFO ] Deduced a trap composed of 77 places in 40 ms of which 0 ms to minimize.
[2021-05-09 06:42:17] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 0 ms to minimize.
[2021-05-09 06:42:17] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 0 ms to minimize.
[2021-05-09 06:42:17] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 3 ms to minimize.
[2021-05-09 06:42:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 25 trap constraints in 1655 ms
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 13300 steps, including 210 resets, run finished after 30 ms. (steps per millisecond=443 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 12900 steps, including 103 resets, run finished after 25 ms. (steps per millisecond=516 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 273 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 273/273 places, 236/236 transitions.
Graph (trivial) has 171 edges and 273 vertex of which 5 / 273 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 516 edges and 269 vertex of which 266 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 266 transition count 163
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 201 transition count 161
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 137 place count 199 transition count 161
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 137 place count 199 transition count 124
Deduced a syphon composed of 37 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 221 place count 152 transition count 124
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 263 place count 110 transition count 82
Iterating global reduction 3 with 42 rules applied. Total rules applied 305 place count 110 transition count 82
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 305 place count 110 transition count 78
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 315 place count 104 transition count 78
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 399 place count 62 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 400 place count 61 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 401 place count 60 transition count 35
Applied a total of 401 rules in 60 ms. Remains 60 /273 variables (removed 213) and now considering 35/236 (removed 201) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/273 places, 35/236 transitions.
[2021-05-09 06:42:17] [INFO ] Flatten gal took : 28 ms
[2021-05-09 06:42:17] [INFO ] Flatten gal took : 7 ms
[2021-05-09 06:42:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4869465563197245036.gal : 5 ms
[2021-05-09 06:42:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6840597517273644412.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/ReachabilityCardinality4869465563197245036.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6840597517273644412.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/ReachabilityCardinality4869465563197245036.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6840597517273644412.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6840597517273644412.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :9 after 27
Invariant property BusinessProcesses-PT-03-ReachabilityFireability-03 does not hold.
FORMULA BusinessProcesses-PT-03-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
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,58,0.024854,4092,2,222,11,1491,6,0,277,1080,0
Total reachable state count : 58

Verifying 1 reachability properties.
Invariant property BusinessProcesses-PT-03-ReachabilityFireability-03 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-03-ReachabilityFireability-03,4,0.025605,4464,2,71,11,1491,7,0,283,1080,0
All properties solved without resorting to model-checking.

BK_STOP 1620542537797

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-03"
export BK_EXAMINATION="ReachabilityFireability"
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-03, examination is ReachabilityFireability"
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-162038143700343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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