Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r021-oct2-158897699200543.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-oct2-158897699200543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 3.3K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 25 22:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 25 17:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 25 17:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 14:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 25 17:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 25 17:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 146K Mar 24 05:37 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-12-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589253682573

[2020-05-12 03:21:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-12 03:21:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-12 03:21:25] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2020-05-12 03:21:25] [INFO ] Transformed 586 places.
[2020-05-12 03:21:25] [INFO ] Transformed 525 transitions.
[2020-05-12 03:21:25] [INFO ] Found NUPN structural information;
[2020-05-12 03:21:25] [INFO ] Parsed PT model containing 586 places and 525 transitions in 135 ms.
Deduced a syphon composed of 4 places in 26 ms
Reduce places removed 4 places and 4 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 74 resets, run finished after 108 ms. (steps per millisecond=92 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 521 rows 582 cols
[2020-05-12 03:21:26] [INFO ] Computed 98 place invariants in 54 ms
[2020-05-12 03:21:26] [INFO ] [Real]Absence check using 55 positive place invariants in 92 ms returned sat
[2020-05-12 03:21:26] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 53 ms returned sat
[2020-05-12 03:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:27] [INFO ] [Real]Absence check using state equation in 917 ms returned sat
[2020-05-12 03:21:28] [INFO ] Deduced a trap composed of 22 places in 507 ms
[2020-05-12 03:21:28] [INFO ] Deduced a trap composed of 19 places in 524 ms
[2020-05-12 03:21:29] [INFO ] Deduced a trap composed of 17 places in 420 ms
[2020-05-12 03:21:29] [INFO ] Deduced a trap composed of 12 places in 182 ms
[2020-05-12 03:21:29] [INFO ] Deduced a trap composed of 23 places in 374 ms
[2020-05-12 03:21:30] [INFO ] Deduced a trap composed of 18 places in 349 ms
[2020-05-12 03:21:30] [INFO ] Deduced a trap composed of 29 places in 319 ms
[2020-05-12 03:21:30] [INFO ] Deduced a trap composed of 123 places in 185 ms
[2020-05-12 03:21:30] [INFO ] Deduced a trap composed of 23 places in 194 ms
[2020-05-12 03:21:31] [INFO ] Deduced a trap composed of 41 places in 385 ms
[2020-05-12 03:21:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s31 s32 s270 s368 s369 s370 s374 s428 s429 s432 s513 s514 s521 s522) 0)") while checking expression at index 0
[2020-05-12 03:21:31] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2020-05-12 03:21:31] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 03:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:32] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2020-05-12 03:21:32] [INFO ] Deduced a trap composed of 27 places in 424 ms
[2020-05-12 03:21:32] [INFO ] Deduced a trap composed of 22 places in 358 ms
[2020-05-12 03:21:33] [INFO ] Deduced a trap composed of 26 places in 339 ms
[2020-05-12 03:21:33] [INFO ] Deduced a trap composed of 118 places in 356 ms
[2020-05-12 03:21:34] [INFO ] Deduced a trap composed of 19 places in 1002 ms
[2020-05-12 03:21:35] [INFO ] Deduced a trap composed of 118 places in 537 ms
[2020-05-12 03:21:35] [INFO ] Deduced a trap composed of 13 places in 367 ms
[2020-05-12 03:21:36] [INFO ] Deduced a trap composed of 17 places in 365 ms
[2020-05-12 03:21:36] [INFO ] Deduced a trap composed of 11 places in 241 ms
[2020-05-12 03:21:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s236 s239 s403 s404 s405 s409 s539 s540) 0)") while checking expression at index 1
[2020-05-12 03:21:36] [INFO ] [Real]Absence check using 55 positive place invariants in 25 ms returned unsat
[2020-05-12 03:21:36] [INFO ] [Real]Absence check using 55 positive place invariants in 55 ms returned sat
[2020-05-12 03:21:36] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 22 ms returned sat
[2020-05-12 03:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:37] [INFO ] [Real]Absence check using state equation in 706 ms returned sat
[2020-05-12 03:21:38] [INFO ] Deduced a trap composed of 11 places in 1653 ms
[2020-05-12 03:21:39] [INFO ] Deduced a trap composed of 137 places in 351 ms
[2020-05-12 03:21:39] [INFO ] Deduced a trap composed of 15 places in 376 ms
[2020-05-12 03:21:40] [INFO ] Deduced a trap composed of 23 places in 346 ms
[2020-05-12 03:21:44] [INFO ] Deduced a trap composed of 24 places in 4126 ms
[2020-05-12 03:21:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s174 s338 s339 s340 s354 s498 s499 s509 s510 s572 s573) 0)") while checking expression at index 3
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive place invariants in 364 ms returned sat
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 30 ms returned unsat
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive place invariants in 58 ms returned sat
[2020-05-12 03:21:44] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 33 ms returned sat
[2020-05-12 03:21:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:46] [INFO ] [Real]Absence check using state equation in 1791 ms returned sat
[2020-05-12 03:21:47] [INFO ] Deduced a trap composed of 18 places in 314 ms
[2020-05-12 03:21:48] [INFO ] Deduced a trap composed of 19 places in 1347 ms
[2020-05-12 03:21:48] [INFO ] Deduced a trap composed of 14 places in 309 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 11 places in 146 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 28 places in 243 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 22 places in 326 ms
[2020-05-12 03:21:49] [INFO ] Deduced a trap composed of 22 places in 193 ms
[2020-05-12 03:21:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s223 s224 s225 s228 s229 s230 s378 s379 s380 s393 s394 s395 s399 s404 s525 s526) 0)") while checking expression at index 5
[2020-05-12 03:21:49] [INFO ] [Real]Absence check using 55 positive place invariants in 35 ms returned sat
[2020-05-12 03:21:49] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 25 ms returned sat
[2020-05-12 03:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:50] [INFO ] [Real]Absence check using state equation in 471 ms returned unsat
[2020-05-12 03:21:50] [INFO ] [Real]Absence check using 55 positive place invariants in 76 ms returned unsat
[2020-05-12 03:21:50] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2020-05-12 03:21:50] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:21:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:51] [INFO ] [Real]Absence check using state equation in 746 ms returned unsat
[2020-05-12 03:21:51] [INFO ] [Real]Absence check using 55 positive place invariants in 57 ms returned sat
[2020-05-12 03:21:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 16 ms returned unsat
[2020-05-12 03:21:51] [INFO ] [Real]Absence check using 55 positive place invariants in 95 ms returned sat
[2020-05-12 03:21:51] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 23 ms returned sat
[2020-05-12 03:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:52] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 17 places in 240 ms
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 13 places in 210 ms
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 17 places in 184 ms
[2020-05-12 03:21:53] [INFO ] Deduced a trap composed of 15 places in 240 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 12 places in 180 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 22 places in 191 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 25 places in 206 ms
[2020-05-12 03:21:54] [INFO ] Deduced a trap composed of 21 places in 77 ms
[2020-05-12 03:21:56] [INFO ] Deduced a trap composed of 23 places in 1911 ms
[2020-05-12 03:21:57] [INFO ] Deduced a trap composed of 26 places in 692 ms
[2020-05-12 03:21:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s142 s145 s146 s147 s148 s149 s333 s334 s335) 0)") while checking expression at index 10
[2020-05-12 03:21:57] [INFO ] [Real]Absence check using 55 positive place invariants in 82 ms returned sat
[2020-05-12 03:21:57] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 69 ms returned sat
[2020-05-12 03:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:21:58] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 11 places in 216 ms
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 19 places in 204 ms
[2020-05-12 03:21:59] [INFO ] Deduced a trap composed of 22 places in 407 ms
[2020-05-12 03:22:00] [INFO ] Deduced a trap composed of 17 places in 238 ms
[2020-05-12 03:22:01] [INFO ] Deduced a trap composed of 15 places in 1460 ms
[2020-05-12 03:22:01] [INFO ] Deduced a trap composed of 35 places in 154 ms
[2020-05-12 03:22:02] [INFO ] Deduced a trap composed of 25 places in 716 ms
[2020-05-12 03:22:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s194 s203 s204 s205 s270 s373 s374 s375 s384 s432 s433 s434 s517 s518) 0)") while checking expression at index 11
[2020-05-12 03:22:02] [INFO ] [Real]Absence check using 55 positive place invariants in 44 ms returned sat
[2020-05-12 03:22:02] [INFO ] [Real]Absence check using 55 positive and 43 generalized place invariants in 20 ms returned sat
[2020-05-12 03:22:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:03] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2020-05-12 03:22:03] [INFO ] Deduced a trap composed of 11 places in 394 ms
[2020-05-12 03:22:04] [INFO ] Deduced a trap composed of 16 places in 714 ms
[2020-05-12 03:22:04] [INFO ] Deduced a trap composed of 19 places in 315 ms
[2020-05-12 03:22:05] [INFO ] Deduced a trap composed of 21 places in 177 ms
[2020-05-12 03:22:05] [INFO ] Deduced a trap composed of 17 places in 347 ms
[2020-05-12 03:22:05] [INFO ] Deduced a trap composed of 12 places in 408 ms
[2020-05-12 03:22:06] [INFO ] Deduced a trap composed of 11 places in 176 ms
[2020-05-12 03:22:06] [INFO ] Deduced a trap composed of 16 places in 162 ms
[2020-05-12 03:22:06] [INFO ] Deduced a trap composed of 109 places in 175 ms
[2020-05-12 03:22:06] [INFO ] Deduced a trap composed of 107 places in 297 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 25 places in 484 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 32 places in 166 ms
[2020-05-12 03:22:07] [INFO ] Deduced a trap composed of 35 places in 169 ms
[2020-05-12 03:22:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s26 s27 s28 s29 s30 s31 s209 s210 s211 s215 s216 s217 s223 s224 s228 s229 s230 s240 s379 s384 s389 s394 s399 s404 s407 s409 s410 s411 s432 s433 s434 s517 s518) 0)") while checking expression at index 12
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 20 out of 582 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 582/582 places, 521/521 transitions.
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 578 transition count 431
Reduce places removed 89 places and 0 transitions.
Iterating post reduction 1 with 89 rules applied. Total rules applied 179 place count 489 transition count 431
Performed 126 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 126 Pre rules applied. Total rules applied 179 place count 489 transition count 305
Deduced a syphon composed of 126 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 269 rules applied. Total rules applied 448 place count 346 transition count 305
Symmetric choice reduction at 2 with 72 rule applications. Total rules 520 place count 346 transition count 305
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 72 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 664 place count 274 transition count 233
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 664 place count 274 transition count 229
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 673 place count 269 transition count 229
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 838 place count 185 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 839 place count 185 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 841 place count 184 transition count 151
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 846 place count 184 transition count 151
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 847 place count 183 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 848 place count 182 transition count 150
Applied a total of 848 rules in 188 ms. Remains 182 /582 variables (removed 400) and now considering 150/521 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/582 places, 150/521 transitions.
Incomplete random walk after 1000000 steps, including 70143 resets, run finished after 2105 ms. (steps per millisecond=475 ) properties seen :[1, 0, 1, 0, 0, 1, 0]
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 15283 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15478 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 16045 resets, run finished after 1151 ms. (steps per millisecond=868 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 15288 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties seen :[0, 0, 0, 0]
// Phase 1: matrix 150 rows 182 cols
[2020-05-12 03:22:13] [INFO ] Computed 73 place invariants in 2 ms
[2020-05-12 03:22:13] [INFO ] [Real]Absence check using 52 positive place invariants in 14 ms returned sat
[2020-05-12 03:22:13] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 6 ms returned sat
[2020-05-12 03:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:14] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2020-05-12 03:22:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-12 03:22:14] [INFO ] [Real]Added 5 Read/Feed constraints in 12 ms returned sat
[2020-05-12 03:22:14] [INFO ] Deduced a trap composed of 43 places in 302 ms
[2020-05-12 03:22:14] [INFO ] Deduced a trap composed of 41 places in 38 ms
[2020-05-12 03:22:14] [INFO ] Deduced a trap composed of 21 places in 19 ms
[2020-05-12 03:22:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 390 ms
[2020-05-12 03:22:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:22:14] [INFO ] [Nat]Absence check using 52 positive place invariants in 19 ms returned sat
[2020-05-12 03:22:14] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 6 ms returned sat
[2020-05-12 03:22:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:14] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2020-05-12 03:22:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-05-12 03:22:14] [INFO ] Deduced a trap composed of 42 places in 160 ms
[2020-05-12 03:22:16] [INFO ] Deduced a trap composed of 42 places in 1320 ms
[2020-05-12 03:22:16] [INFO ] Deduced a trap composed of 45 places in 86 ms
[2020-05-12 03:22:16] [INFO ] Deduced a trap composed of 44 places in 69 ms
[2020-05-12 03:22:16] [INFO ] Deduced a trap composed of 43 places in 584 ms
[2020-05-12 03:22:16] [INFO ] Deduced a trap composed of 21 places in 43 ms
[2020-05-12 03:22:16] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2387 ms
[2020-05-12 03:22:17] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 10 ms.
[2020-05-12 03:22:17] [INFO ] Added : 59 causal constraints over 12 iterations in 401 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using 52 positive place invariants in 44 ms returned sat
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-12 03:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2020-05-12 03:22:17] [INFO ] [Real]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-05-12 03:22:17] [INFO ] Deduced a trap composed of 16 places in 26 ms
[2020-05-12 03:22:17] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 44 ms
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using 52 positive place invariants in 33 ms returned sat
[2020-05-12 03:22:17] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 13 ms returned sat
[2020-05-12 03:22:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:18] [INFO ] [Real]Absence check using state equation in 186 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 22 places in 21 ms
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 16 places in 16 ms
[2020-05-12 03:22:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2020-05-12 03:22:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:22:18] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 9 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:18] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2020-05-12 03:22:18] [INFO ] [Nat]Added 5 Read/Feed constraints in 12 ms returned sat
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 40 places in 44 ms
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 45 places in 150 ms
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 41 places in 121 ms
[2020-05-12 03:22:18] [INFO ] Deduced a trap composed of 40 places in 148 ms
[2020-05-12 03:22:19] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2020-05-12 03:22:19] [INFO ] Deduced a trap composed of 42 places in 460 ms
[2020-05-12 03:22:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1300 ms
[2020-05-12 03:22:19] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 11 ms.
[2020-05-12 03:22:20] [INFO ] Added : 61 causal constraints over 13 iterations in 568 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-05-12 03:22:20] [INFO ] [Real]Absence check using 52 positive place invariants in 71 ms returned sat
[2020-05-12 03:22:20] [INFO ] [Real]Absence check using 52 positive and 21 generalized place invariants in 47 ms returned sat
[2020-05-12 03:22:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:21] [INFO ] [Real]Absence check using state equation in 946 ms returned sat
[2020-05-12 03:22:21] [INFO ] [Real]Added 5 Read/Feed constraints in 18 ms returned sat
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 42 places in 403 ms
[2020-05-12 03:22:21] [INFO ] Deduced a trap composed of 41 places in 81 ms
[2020-05-12 03:22:22] [INFO ] Deduced a trap composed of 21 places in 106 ms
[2020-05-12 03:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 665 ms
[2020-05-12 03:22:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-12 03:22:22] [INFO ] [Nat]Absence check using 52 positive place invariants in 99 ms returned sat
[2020-05-12 03:22:22] [INFO ] [Nat]Absence check using 52 positive and 21 generalized place invariants in 104 ms returned sat
[2020-05-12 03:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-12 03:22:23] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2020-05-12 03:22:23] [INFO ] [Nat]Added 5 Read/Feed constraints in 9 ms returned sat
[2020-05-12 03:22:23] [INFO ] Deduced a trap composed of 41 places in 100 ms
[2020-05-12 03:22:23] [INFO ] Deduced a trap composed of 21 places in 31 ms
[2020-05-12 03:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 179 ms
[2020-05-12 03:22:23] [INFO ] Computed and/alt/rep : 145/807/145 causal constraints in 11 ms.
[2020-05-12 03:22:23] [INFO ] Added : 57 causal constraints over 12 iterations in 320 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 8100 steps, including 377 resets, run finished after 21 ms. (steps per millisecond=385 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8300 steps, including 344 resets, run finished after 19 ms. (steps per millisecond=436 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 347 resets, run finished after 19 ms. (steps per millisecond=447 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 9 out of 182 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 182/182 places, 150/150 transitions.
Graph (trivial) has 9 edges and 182 vertex of which 2 / 182 are part of one of the 1 SCC in 37 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 181 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 180 transition count 147
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 180 transition count 145
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 177 transition count 145
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 172 transition count 140
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 172 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 24 place count 170 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 169 transition count 137
Applied a total of 25 rules in 83 ms. Remains 169 /182 variables (removed 13) and now considering 137/150 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 169/182 places, 137/150 transitions.
Finished random walk after 1557 steps, including 45 resets, run visited all 3 properties in 4 ms. (steps per millisecond=389 )
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1589253744066

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-12"
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"

# 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-12, 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 r021-oct2-158897699200543"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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