fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r182-oct2-158987914100558
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for BusinessProcesses-PT-14

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.270 3600000.00 144527.00 263.20 FFFTFTTTTFTFFTFT normal

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-158987914100558.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-14, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r182-oct2-158987914100558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 3.1K Mar 26 02:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 26 02:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 22:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.2K Apr 8 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.6K Mar 25 14:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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.7K 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 156K 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-14-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591163995236

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:59:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:59:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:59:59] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2020-06-03 05:59:59] [INFO ] Transformed 624 places.
[2020-06-03 05:59:59] [INFO ] Transformed 564 transitions.
[2020-06-03 05:59:59] [INFO ] Found NUPN structural information;
[2020-06-03 05:59:59] [INFO ] Parsed PT model containing 624 places and 564 transitions in 316 ms.
Deduced a syphon composed of 8 places in 11 ms
Reduce places removed 8 places and 8 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 72 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 69 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[1, 0, 1, 0, 1, 0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 556 rows 616 cols
[2020-06-03 05:59:59] [INFO ] Computed 99 place invariants in 57 ms
[2020-06-03 06:00:00] [INFO ] [Real]Absence check using 60 positive place invariants in 89 ms returned sat
[2020-06-03 06:00:00] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 53 ms returned sat
[2020-06-03 06:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:04] [INFO ] [Real]Absence check using state equation in 4042 ms returned sat
[2020-06-03 06:00:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:04] [INFO ] [Nat]Absence check using 60 positive place invariants in 179 ms returned sat
[2020-06-03 06:00:04] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 66 ms returned sat
[2020-06-03 06:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:08] [INFO ] [Nat]Absence check using state equation in 3771 ms returned sat
[2020-06-03 06:00:11] [INFO ] Deduced a trap composed of 14 places in 2861 ms
[2020-06-03 06:00:11] [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 s213 s317 s318 s319) 0)") while checking expression at index 0
[2020-06-03 06:00:11] [INFO ] [Real]Absence check using 60 positive place invariants in 118 ms returned sat
[2020-06-03 06:00:11] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 38 ms returned sat
[2020-06-03 06:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:15] [INFO ] [Real]Absence check using state equation in 3159 ms returned sat
[2020-06-03 06:00:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:15] [INFO ] [Nat]Absence check using 60 positive place invariants in 48 ms returned sat
[2020-06-03 06:00:15] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 21 ms returned sat
[2020-06-03 06:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:17] [INFO ] [Nat]Absence check using state equation in 2118 ms returned sat
[2020-06-03 06:00:22] [INFO ] Deduced a trap composed of 14 places in 5024 ms
[2020-06-03 06:00:22] [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 s213 s317 s318 s319) 0)") while checking expression at index 1
[2020-06-03 06:00:22] [INFO ] [Real]Absence check using 60 positive place invariants in 240 ms returned sat
[2020-06-03 06:00:23] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 103 ms returned sat
[2020-06-03 06:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:26] [INFO ] [Real]Absence check using state equation in 3398 ms returned sat
[2020-06-03 06:00:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:26] [INFO ] [Nat]Absence check using 60 positive place invariants in 97 ms returned sat
[2020-06-03 06:00:26] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 111 ms returned sat
[2020-06-03 06:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:29] [INFO ] [Nat]Absence check using state equation in 2737 ms returned sat
[2020-06-03 06:00:30] [INFO ] Deduced a trap composed of 14 places in 1086 ms
[2020-06-03 06:00:38] [INFO ] Deduced a trap composed of 14 places in 7978 ms
[2020-06-03 06:00:38] [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 s225 s337 s338 s339 s573 s574) 0)") while checking expression at index 2
[2020-06-03 06:00:38] [INFO ] [Real]Absence check using 60 positive place invariants in 58 ms returned sat
[2020-06-03 06:00:38] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 34 ms returned sat
[2020-06-03 06:00:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:40] [INFO ] [Real]Absence check using state equation in 1468 ms returned sat
[2020-06-03 06:00:41] [INFO ] Deduced a trap composed of 13 places in 905 ms
[2020-06-03 06:00:43] [INFO ] Deduced a trap composed of 15 places in 2517 ms
[2020-06-03 06:00:43] [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 s225 s228 s229 s230 s337 s338 s339) 0)") while checking expression at index 3
[2020-06-03 06:00:44] [INFO ] [Real]Absence check using 60 positive place invariants in 183 ms returned sat
[2020-06-03 06:00:44] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 61 ms returned sat
[2020-06-03 06:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:45] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2020-06-03 06:00:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:45] [INFO ] [Nat]Absence check using 60 positive place invariants in 113 ms returned sat
[2020-06-03 06:00:45] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 104 ms returned sat
[2020-06-03 06:00:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:48] [INFO ] [Nat]Absence check using state equation in 2913 ms returned sat
[2020-06-03 06:00:48] [INFO ] Deduced a trap composed of 28 places in 242 ms
[2020-06-03 06:00:48] [INFO ] Deduced a trap composed of 13 places in 181 ms
[2020-06-03 06:00:49] [INFO ] Deduced a trap composed of 34 places in 230 ms
[2020-06-03 06:00:49] [INFO ] Deduced a trap composed of 48 places in 218 ms
[2020-06-03 06:00:49] [INFO ] Deduced a trap composed of 31 places in 336 ms
[2020-06-03 06:00:49] [INFO ] Deduced a trap composed of 20 places in 312 ms
[2020-06-03 06:00:51] [INFO ] Deduced a trap composed of 19 places in 1118 ms
[2020-06-03 06:00:51] [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 s63 s64 s228 s229 s230 s234 s235 s236 s243 s246 s332 s333 s334 s338 s428 s433) 0)") while checking expression at index 4
[2020-06-03 06:00:51] [INFO ] [Real]Absence check using 60 positive place invariants in 239 ms returned sat
[2020-06-03 06:00:51] [INFO ] [Real]Absence check using 60 positive and 39 generalized place invariants in 68 ms returned sat
[2020-06-03 06:00:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:55] [INFO ] [Real]Absence check using state equation in 3500 ms returned sat
[2020-06-03 06:00:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:00:55] [INFO ] [Nat]Absence check using 60 positive place invariants in 103 ms returned sat
[2020-06-03 06:00:55] [INFO ] [Nat]Absence check using 60 positive and 39 generalized place invariants in 39 ms returned sat
[2020-06-03 06:00:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:00:58] [INFO ] [Nat]Absence check using state equation in 3470 ms returned sat
[2020-06-03 06:01:00] [INFO ] Deduced a trap composed of 14 places in 2051 ms
[2020-06-03 06:01:00] [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 s213 s317 s318 s319) 0)") while checking expression at index 5
Support contains 17 out of 616 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 616/616 places, 556/556 transitions.
Graph (trivial) has 339 edges and 616 vertex of which 4 / 616 are part of one of the 1 SCC in 35 ms
Free SCC test removed 3 places
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Graph (complete) has 1256 edges and 613 vertex of which 607 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.24 ms
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 135 Post agglomeration using F-continuation condition.Transition count delta: 135
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 607 transition count 416
Reduce places removed 135 places and 0 transitions.
Iterating post reduction 1 with 135 rules applied. Total rules applied 276 place count 472 transition count 416
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 87 Pre rules applied. Total rules applied 276 place count 472 transition count 329
Deduced a syphon composed of 87 places in 4 ms
Ensure Unique test removed 14 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 188 rules applied. Total rules applied 464 place count 371 transition count 329
Symmetric choice reduction at 2 with 79 rule applications. Total rules 543 place count 371 transition count 329
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 79 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 701 place count 292 transition count 250
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 701 place count 292 transition count 241
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 721 place count 281 transition count 241
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 176 rules applied. Total rules applied 897 place count 192 transition count 154
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 2 with 2 rules applied. Total rules applied 899 place count 191 transition count 158
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 902 place count 191 transition count 155
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 905 place count 188 transition count 155
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 910 place count 188 transition count 155
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 911 place count 187 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 912 place count 186 transition count 154
Applied a total of 912 rules in 258 ms. Remains 186 /616 variables (removed 430) and now considering 154/556 (removed 402) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/616 places, 154/556 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2771 ms. (steps per millisecond=360 ) properties seen :[0, 0, 0, 0, 0, 1]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 1693 ms. (steps per millisecond=590 ) properties seen :[0, 1, 0, 0, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 1 resets, run finished after 1791 ms. (steps per millisecond=558 ) properties seen :[0, 0, 1, 0]
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties seen :[0, 0, 0]
// Phase 1: matrix 154 rows 186 cols
[2020-06-03 06:01:09] [INFO ] Computed 75 place invariants in 2 ms
[2020-06-03 06:01:10] [INFO ] [Real]Absence check using 55 positive place invariants in 241 ms returned sat
[2020-06-03 06:01:10] [INFO ] [Real]Absence check using 55 positive and 20 generalized place invariants in 22 ms returned sat
[2020-06-03 06:01:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:10] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2020-06-03 06:01:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:01:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 28 ms returned sat
[2020-06-03 06:01:11] [INFO ] [Nat]Absence check using 55 positive and 20 generalized place invariants in 8 ms returned sat
[2020-06-03 06:01:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:11] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2020-06-03 06:01:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-06-03 06:01:11] [INFO ] [Nat]Added 5 Read/Feed constraints in 27 ms returned sat
[2020-06-03 06:01:11] [INFO ] Computed and/alt/rep : 150/467/150 causal constraints in 15 ms.
[2020-06-03 06:01:11] [INFO ] Added : 27 causal constraints over 7 iterations in 156 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2020-06-03 06:01:11] [INFO ] [Real]Absence check using 55 positive place invariants in 149 ms returned sat
[2020-06-03 06:01:11] [INFO ] [Real]Absence check using 55 positive and 20 generalized place invariants in 30 ms returned sat
[2020-06-03 06:01:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:12] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2020-06-03 06:01:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:01:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 56 ms returned sat
[2020-06-03 06:01:12] [INFO ] [Nat]Absence check using 55 positive and 20 generalized place invariants in 17 ms returned sat
[2020-06-03 06:01:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:13] [INFO ] [Nat]Absence check using state equation in 739 ms returned sat
[2020-06-03 06:01:13] [INFO ] [Nat]Added 5 Read/Feed constraints in 12 ms returned sat
[2020-06-03 06:01:13] [INFO ] Computed and/alt/rep : 150/467/150 causal constraints in 26 ms.
[2020-06-03 06:01:13] [INFO ] Added : 75 causal constraints over 16 iterations in 491 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-06-03 06:01:13] [INFO ] [Real]Absence check using 55 positive place invariants in 61 ms returned sat
[2020-06-03 06:01:13] [INFO ] [Real]Absence check using 55 positive and 20 generalized place invariants in 9 ms returned sat
[2020-06-03 06:01:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:14] [INFO ] [Real]Absence check using state equation in 642 ms returned sat
[2020-06-03 06:01:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:01:14] [INFO ] [Nat]Absence check using 55 positive place invariants in 366 ms returned sat
[2020-06-03 06:01:15] [INFO ] [Nat]Absence check using 55 positive and 20 generalized place invariants in 131 ms returned sat
[2020-06-03 06:01:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:01:15] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2020-06-03 06:01:15] [INFO ] [Nat]Added 5 Read/Feed constraints in 23 ms returned sat
[2020-06-03 06:01:15] [INFO ] Deduced a trap composed of 38 places in 98 ms
[2020-06-03 06:01:15] [INFO ] Deduced a trap composed of 38 places in 477 ms
[2020-06-03 06:01:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 627 ms
[2020-06-03 06:01:15] [INFO ] Computed and/alt/rep : 150/467/150 causal constraints in 18 ms.
[2020-06-03 06:01:16] [INFO ] Added : 52 causal constraints over 11 iterations in 219 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
Incomplete Parikh walk after 5900 steps, including 152 resets, run finished after 36 ms. (steps per millisecond=163 ) properties seen :[1, 0, 1] could not realise parikh vector
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 56 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
FORMULA BusinessProcesses-PT-14-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_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-14"
export BK_EXAMINATION="ReachabilityCardinality"
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-14, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r182-oct2-158987914100558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;