Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399700543.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
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 r048-tajo-171620399700543
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 146K May 18 16:42 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-2024-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716335296783

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 23:48:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:48:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:48:18] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-21 23:48:18] [INFO ] Transformed 586 places.
[2024-05-21 23:48:18] [INFO ] Transformed 525 transitions.
[2024-05-21 23:48:18] [INFO ] Found NUPN structural information;
[2024-05-21 23:48:18] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 222 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
[2024-05-21 23:48:18] [INFO ] Flatten gal took : 153 ms
RANDOM walk for 40000 steps (292 resets) in 1474 ms. (27 steps per ms) remains 7/16 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:48:18] [INFO ] Flatten gal took : 76 ms
[2024-05-21 23:48:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3705344436465635625.gal : 47 ms
[2024-05-21 23:48:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality314080469810993422.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3705344436465635625.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality314080469810993422.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (62 resets) in 546 ms. (73 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality314080469810993422.prop.
BEST_FIRST walk for 40003 steps (56 resets) in 344 ms. (115 steps per ms) remains 6/6 properties
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :61 after 201
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,7 properties remain. new max is 1024
SDD size :381 after 3788
BEST_FIRST walk for 40003 steps (50 resets) in 685 ms. (58 steps per ms) remains 6/6 properties
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :3788 after 39961
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :2.8345e+06 after 4.54137e+06
BEST_FIRST walk for 40004 steps (46 resets) in 442 ms. (90 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (37 resets) in 153 ms. (259 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (63 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
// Phase 1: matrix 521 rows 582 cols
[2024-05-21 23:48:19] [INFO ] Computed 98 invariants in 21 ms
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :4.54137e+06 after 6.26726e+07
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 141/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-03 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 334/475 variables, 55/196 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 334/530 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/475 variables, 0/530 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 107/582 variables, 43/573 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/582 variables, 107/680 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 521/1103 variables, 582/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 1262 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1162 ms.
Refiners :[Domain max(s): 582/582 constraints, Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-13 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 348/469 variables, 55/176 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 348/524 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 23 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 12 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 2 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 3 ms to minimize.
[2024-05-21 23:48:21] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 16384
SDD size :6.26726e+07 after 4.23526e+10
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 30 places in 574 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 20 places in 146 ms of which 3 ms to minimize.
[2024-05-21 23:48:22] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 33 places in 140 ms of which 3 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 109 places in 122 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 2 ms to minimize.
[2024-05-21 23:48:23] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 3 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 109 places in 80 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 20/544 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 123 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 113 places in 97 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:48:24] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 107 places in 92 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 140 places in 91 ms of which 2 ms to minimize.
SDD proceeding with computation,7 properties remain. new max is 32768
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 133 places in 90 ms of which 3 ms to minimize.
SDD size :4.23526e+10 after 6.36148e+10
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 122 places in 85 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 130 places in 91 ms of which 5 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 133 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 115 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 107 places in 87 ms of which 2 ms to minimize.
[2024-05-21 23:48:26] [INFO ] Deduced a trap composed of 143 places in 81 ms of which 2 ms to minimize.
SMT process timed out in 6353ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 87 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 579 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 579 transition count 466
Reduce places removed 55 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 62 rules applied. Total rules applied 118 place count 524 transition count 459
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 125 place count 517 transition count 459
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 125 place count 517 transition count 349
Deduced a syphon composed of 110 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 358 place count 394 transition count 349
Discarding 54 places :
Symmetric choice reduction at 3 with 54 rule applications. Total rules 412 place count 340 transition count 295
Iterating global reduction 3 with 54 rules applied. Total rules applied 466 place count 340 transition count 295
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 605 place count 270 transition count 226
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 607 place count 269 transition count 230
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 269 transition count 230
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 610 place count 268 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 267 transition count 229
Applied a total of 611 rules in 129 ms. Remains 267 /582 variables (removed 315) and now considering 229/521 (removed 292) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 267/582 places, 229/521 transitions.
RANDOM walk for 40000 steps (861 resets) in 907 ms. (44 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (177 resets) in 337 ms. (118 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (131 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (103 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (151 resets) in 86 ms. (459 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 888410 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :2 out of 4
Probabilistic random walk after 888410 steps, saw 131297 distinct states, run finished after 3005 ms. (steps per millisecond=295 ) properties seen :2
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 229 rows 267 cols
[2024-05-21 23:48:29] [INFO ] Computed 80 invariants in 8 ms
[2024-05-21 23:48:29] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 150/216 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/218 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 45/263 variables, 29/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 229/492 variables, 263/342 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 3/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/496 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/496 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 496/496 variables, and 350 constraints, problems are : Problem set: 0 solved, 2 unsolved in 272 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 267/267 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 150/216 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 51 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:30] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 4/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/218 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 11 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 45/263 variables, 29/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,7 properties remain. new max is 65536
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/263 variables, 1/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/263 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :6.36148e+10 after 1.03046e+11
At refinement iteration 13 (OVERLAPS) 229/492 variables, 263/361 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 3/364 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/492 variables, 3/367 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/492 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/496 variables, 4/371 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/496 variables, 1/372 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/496 variables, 1/373 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:48:31] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/496 variables, 4/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/496 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/496 variables, 0/377 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 496/496 variables, and 377 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2087 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 267/267 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 26/26 constraints]
After SMT, in 2391ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 72 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=36 )
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2024-04 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 14114 ms.

BK_STOP 1716335312167

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
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 r048-tajo-171620399700543"
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 ;