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.r182-oct2-158987914000527.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 itslola
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914000527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 3.6K Mar 26 02:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 02:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 22:44 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.6K 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.2K Mar 25 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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 131K 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591161397343

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:16:41] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:16:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:16:41] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-06-03 05:16:41] [INFO ] Transformed 518 places.
[2020-06-03 05:16:41] [INFO ] Transformed 471 transitions.
[2020-06-03 05:16:41] [INFO ] Found NUPN structural information;
[2020-06-03 05:16:41] [INFO ] Parsed PT model containing 518 places and 471 transitions in 213 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 117 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 141 ms. (steps per millisecond=70 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 471 rows 518 cols
[2020-06-03 05:16:42] [INFO ] Computed 85 place invariants in 54 ms
[2020-06-03 05:16:43] [INFO ] [Real]Absence check using 48 positive place invariants in 69 ms returned sat
[2020-06-03 05:16:43] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 108 ms returned sat
[2020-06-03 05:16:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:44] [INFO ] [Real]Absence check using state equation in 1251 ms returned unsat
[2020-06-03 05:16:44] [INFO ] [Real]Absence check using 48 positive place invariants in 111 ms returned sat
[2020-06-03 05:16:44] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 32 ms returned sat
[2020-06-03 05:16:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:47] [INFO ] [Real]Absence check using state equation in 2287 ms returned sat
[2020-06-03 05:16:47] [INFO ] Deduced a trap composed of 11 places in 686 ms
[2020-06-03 05:16:48] [INFO ] Deduced a trap composed of 100 places in 706 ms
[2020-06-03 05:16:49] [INFO ] Deduced a trap composed of 8 places in 937 ms
[2020-06-03 05:16: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 s204 s237 s238 s239) 0)") while checking expression at index 1
[2020-06-03 05:16:50] [INFO ] [Real]Absence check using 48 positive place invariants in 348 ms returned sat
[2020-06-03 05:16:50] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 129 ms returned sat
[2020-06-03 05:16:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:52] [INFO ] [Real]Absence check using state equation in 2390 ms returned sat
[2020-06-03 05:16:53] [INFO ] Deduced a trap composed of 8 places in 442 ms
[2020-06-03 05:16:53] [INFO ] Deduced a trap composed of 22 places in 382 ms
[2020-06-03 05:16:53] [INFO ] Deduced a trap composed of 17 places in 160 ms
[2020-06-03 05:16:53] [INFO ] Deduced a trap composed of 18 places in 189 ms
[2020-06-03 05:16:54] [INFO ] Deduced a trap composed of 34 places in 188 ms
[2020-06-03 05:16:54] [INFO ] Deduced a trap composed of 24 places in 852 ms
[2020-06-03 05:16:54] [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 s70 s71 s72 s73 s74 s75 s76 s77 s114 s283 s432 s433) 0)") while checking expression at index 2
[2020-06-03 05:16:55] [INFO ] [Real]Absence check using 48 positive place invariants in 42 ms returned unsat
[2020-06-03 05:16:55] [INFO ] [Real]Absence check using 48 positive place invariants in 80 ms returned sat
[2020-06-03 05:16:55] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 179 ms returned sat
[2020-06-03 05:16:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:16:57] [INFO ] [Real]Absence check using state equation in 1917 ms returned sat
[2020-06-03 05:16:59] [INFO ] Deduced a trap composed of 33 places in 1727 ms
[2020-06-03 05:16:59] [INFO ] Deduced a trap composed of 10 places in 425 ms
[2020-06-03 05:17:01] [INFO ] Deduced a trap composed of 30 places in 1621 ms
[2020-06-03 05:17:01] [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 s98 s99 s100 s101 s102 s109 s110 s111 s112 s113 s337 s338 s339 s342 s343 s344 s371) 0)") while checking expression at index 4
[2020-06-03 05:17:01] [INFO ] [Real]Absence check using 48 positive place invariants in 40 ms returned unsat
[2020-06-03 05:17:01] [INFO ] [Real]Absence check using 48 positive place invariants in 176 ms returned sat
[2020-06-03 05:17:02] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 154 ms returned sat
[2020-06-03 05:17:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:03] [INFO ] [Real]Absence check using state equation in 1743 ms returned sat
[2020-06-03 05:17:05] [INFO ] Deduced a trap composed of 8 places in 1307 ms
[2020-06-03 05:17:05] [INFO ] Deduced a trap composed of 15 places in 662 ms
[2020-06-03 05:17:06] [INFO ] Deduced a trap composed of 24 places in 737 ms
[2020-06-03 05:17:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 05:17:08] [INFO ] Deduced a trap composed of 9 places in 1428 ms
[2020-06-03 05:17:08] [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 s212 s213 s351 s352 s353 s354 s355) 0)") while checking expression at index 6
[2020-06-03 05:17:08] [INFO ] [Real]Absence check using 48 positive place invariants in 66 ms returned sat
[2020-06-03 05:17:08] [INFO ] [Real]Absence check using 48 positive and 37 generalized place invariants in 85 ms returned sat
[2020-06-03 05:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:10] [INFO ] [Real]Absence check using state equation in 2204 ms returned sat
[2020-06-03 05:17:11] [INFO ] Deduced a trap composed of 10 places in 617 ms
[2020-06-03 05:17:11] [INFO ] Deduced a trap composed of 18 places in 604 ms
[2020-06-03 05:17:13] [INFO ] Deduced a trap composed of 13 places in 1307 ms
[2020-06-03 05:17:13] [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 s132 s327 s328 s329) 0)") while checking expression at index 7
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 28 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 471/471 transitions.
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.25 ms
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 516 transition count 395
Reduce places removed 75 places and 0 transitions.
Iterating post reduction 1 with 75 rules applied. Total rules applied 151 place count 441 transition count 395
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 104 Pre rules applied. Total rules applied 151 place count 441 transition count 291
Deduced a syphon composed of 104 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 217 rules applied. Total rules applied 368 place count 328 transition count 291
Symmetric choice reduction at 2 with 64 rule applications. Total rules 432 place count 328 transition count 291
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 64 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 560 place count 264 transition count 227
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 560 place count 264 transition count 221
Deduced a syphon composed of 6 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 13 rules applied. Total rules applied 573 place count 257 transition count 221
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 141 rules applied. Total rules applied 714 place count 186 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 715 place count 186 transition count 150
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 717 place count 185 transition count 153
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 722 place count 185 transition count 153
Applied a total of 722 rules in 228 ms. Remains 185 /518 variables (removed 333) and now considering 153/471 (removed 318) transitions.
Finished structural reductions, in 1 iterations. Remains : 185/518 places, 153/471 transitions.
Incomplete random walk after 1000000 steps, including 60199 resets, run finished after 3633 ms. (steps per millisecond=275 ) properties seen :[1, 0, 0, 0, 0]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 14256 resets, run finished after 1981 ms. (steps per millisecond=504 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 14455 resets, run finished after 1583 ms. (steps per millisecond=631 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 15372 resets, run finished after 1480 ms. (steps per millisecond=675 ) properties seen :[0, 0, 1, 0]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 14521 resets, run finished after 1194 ms. (steps per millisecond=837 ) properties seen :[0, 0, 0]
// Phase 1: matrix 153 rows 185 cols
[2020-06-03 05:17:23] [INFO ] Computed 73 place invariants in 2 ms
[2020-06-03 05:17:23] [INFO ] [Real]Absence check using 45 positive place invariants in 118 ms returned sat
[2020-06-03 05:17:23] [INFO ] [Real]Absence check using 45 positive and 28 generalized place invariants in 65 ms returned sat
[2020-06-03 05:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:24] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2020-06-03 05:17:24] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 05:17:24] [INFO ] [Real]Added 5 Read/Feed constraints in 4 ms returned sat
[2020-06-03 05:17:24] [INFO ] Computed and/alt/rep : 151/1015/151 causal constraints in 13 ms.
[2020-06-03 05:17:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:17:24] [INFO ] [Nat]Absence check using 45 positive place invariants in 256 ms returned sat
[2020-06-03 05:17:24] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 28 ms returned sat
[2020-06-03 05:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:24] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-06-03 05:17:24] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:17:25] [INFO ] Deduced a trap composed of 9 places in 399 ms
[2020-06-03 05:17:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 431 ms
[2020-06-03 05:17:25] [INFO ] Computed and/alt/rep : 151/1015/151 causal constraints in 42 ms.
[2020-06-03 05:17:26] [INFO ] Added : 88 causal constraints over 18 iterations in 1122 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-06-03 05:17:26] [INFO ] [Real]Absence check using 45 positive place invariants in 22 ms returned sat
[2020-06-03 05:17:26] [INFO ] [Real]Absence check using 45 positive and 28 generalized place invariants in 13 ms returned sat
[2020-06-03 05:17:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:27] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2020-06-03 05:17:27] [INFO ] [Real]Added 5 Read/Feed constraints in 11 ms returned sat
[2020-06-03 05:17:27] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:17:27] [INFO ] [Nat]Absence check using 45 positive place invariants in 211 ms returned sat
[2020-06-03 05:17:27] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 43 ms returned sat
[2020-06-03 05:17:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:27] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2020-06-03 05:17:27] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-06-03 05:17:29] [INFO ] Deduced a trap composed of 6 places in 1565 ms
[2020-06-03 05:17:30] [INFO ] Deduced a trap composed of 4 places in 807 ms
[2020-06-03 05:17:30] [INFO ] Deduced a trap composed of 6 places in 80 ms
[2020-06-03 05:17:31] [INFO ] Deduced a trap composed of 5 places in 1269 ms
[2020-06-03 05:17:31] [INFO ] Deduced a trap composed of 40 places in 142 ms
[2020-06-03 05:17:31] [INFO ] Deduced a trap composed of 42 places in 59 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 41 places in 164 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 41 places in 63 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 40 places in 70 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 43 places in 91 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 41 places in 125 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 44 places in 260 ms
[2020-06-03 05:17:32] [INFO ] Deduced a trap composed of 40 places in 122 ms
[2020-06-03 05:17:33] [INFO ] Deduced a trap composed of 8 places in 72 ms
[2020-06-03 05:17:33] [INFO ] Deduced a trap composed of 40 places in 111 ms
[2020-06-03 05:17:33] [INFO ] Deduced a trap composed of 44 places in 304 ms
[2020-06-03 05:17:34] [INFO ] Deduced a trap composed of 41 places in 1019 ms
[2020-06-03 05:17:35] [INFO ] Deduced a trap composed of 43 places in 515 ms
[2020-06-03 05:17:35] [INFO ] Deduced a trap composed of 40 places in 103 ms
[2020-06-03 05:17:35] [INFO ] Deduced a trap composed of 42 places in 233 ms
[2020-06-03 05:17:35] [INFO ] Deduced a trap composed of 41 places in 92 ms
[2020-06-03 05:17:35] [INFO ] Deduced a trap composed of 5 places in 124 ms
[2020-06-03 05:17:36] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-06-03 05:17:36] [INFO ] Deduced a trap composed of 40 places in 245 ms
[2020-06-03 05:17:36] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 8369 ms
[2020-06-03 05:17:36] [INFO ] Computed and/alt/rep : 151/1015/151 causal constraints in 14 ms.
[2020-06-03 05:17:37] [INFO ] Added : 92 causal constraints over 20 iterations in 1326 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-06-03 05:17:37] [INFO ] [Real]Absence check using 45 positive place invariants in 34 ms returned sat
[2020-06-03 05:17:37] [INFO ] [Real]Absence check using 45 positive and 28 generalized place invariants in 69 ms returned sat
[2020-06-03 05:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:38] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2020-06-03 05:17:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:17:38] [INFO ] [Nat]Absence check using 45 positive place invariants in 153 ms returned sat
[2020-06-03 05:17:39] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 71 ms returned sat
[2020-06-03 05:17:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:39] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-03 05:17:39] [INFO ] [Nat]Added 5 Read/Feed constraints in 6 ms returned sat
[2020-06-03 05:17:39] [INFO ] Computed and/alt/rep : 151/1015/151 causal constraints in 19 ms.
[2020-06-03 05:17:40] [INFO ] Added : 85 causal constraints over 18 iterations in 827 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 18500 steps, including 878 resets, run finished after 73 ms. (steps per millisecond=253 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 7600 steps, including 313 resets, run finished after 24 ms. (steps per millisecond=316 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 13000 steps, including 895 resets, run finished after 28 ms. (steps per millisecond=464 ) properties seen :[0, 0] could not realise parikh vector
Support contains 21 out of 185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 185/185 places, 153/153 transitions.
Graph (trivial) has 8 edges and 185 vertex of which 2 / 185 are part of one of the 1 SCC in 3 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 184 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 183 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 183 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 8 place count 181 transition count 149
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 18 place count 176 transition count 144
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 176 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 174 transition count 142
Applied a total of 22 rules in 34 ms. Remains 174 /185 variables (removed 11) and now considering 142/153 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 174/185 places, 142/153 transitions.
Incomplete random walk after 1000000 steps, including 28909 resets, run finished after 1979 ms. (steps per millisecond=505 ) properties seen :[0, 1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 7458 resets, run finished after 1222 ms. (steps per millisecond=818 ) properties seen :[0]
// Phase 1: matrix 142 rows 174 cols
[2020-06-03 05:17:43] [INFO ] Computed 72 place invariants in 3 ms
[2020-06-03 05:17:43] [INFO ] [Real]Absence check using 45 positive place invariants in 153 ms returned sat
[2020-06-03 05:17:44] [INFO ] [Real]Absence check using 45 positive and 27 generalized place invariants in 79 ms returned sat
[2020-06-03 05:17:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:44] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2020-06-03 05:17:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2020-06-03 05:17:44] [INFO ] [Real]Added 12 Read/Feed constraints in 30 ms returned sat
[2020-06-03 05:17:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:17:44] [INFO ] [Nat]Absence check using 45 positive place invariants in 154 ms returned sat
[2020-06-03 05:17:44] [INFO ] [Nat]Absence check using 45 positive and 27 generalized place invariants in 37 ms returned sat
[2020-06-03 05:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:17:45] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2020-06-03 05:17:45] [INFO ] [Nat]Added 12 Read/Feed constraints in 60 ms returned sat
[2020-06-03 05:17:45] [INFO ] Computed and/alt/rep : 140/1985/140 causal constraints in 24 ms.
[2020-06-03 05:17:45] [INFO ] Added : 74 causal constraints over 15 iterations in 510 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 8400 steps, including 636 resets, run finished after 18 ms. (steps per millisecond=466 ) properties seen :[0] could not realise parikh vector
Support contains 10 out of 174 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 174/174 places, 142/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 174 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 173 transition count 141
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 173 transition count 135
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 16 place count 165 transition count 135
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 165 transition count 135
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 164 transition count 134
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 160 transition count 131
Applied a total of 26 rules in 15 ms. Remains 160 /174 variables (removed 14) and now considering 131/142 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 160/174 places, 131/142 transitions.
Incomplete random walk after 1000000 steps, including 35391 resets, run finished after 1821 ms. (steps per millisecond=549 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 9939 resets, run finished after 1176 ms. (steps per millisecond=850 ) properties seen :[0]
Finished probabilistic random walk after 1238123 steps, run visited all 1 properties in 3618 ms. (steps per millisecond=342 )
Probabilistic random walk after 1238123 steps, saw 310005 distinct states, run finished after 3618 ms. (steps per millisecond=342 ) properties seen :[1]
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

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

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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
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 itslola"
echo " Input is BusinessProcesses-PT-10, 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 r182-oct2-158987914000527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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