Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821400805.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C03, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821400805
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 12K Apr 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18M May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652871333496

Running Version 202205111006
[2022-05-18 10:55:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 10:55:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 10:55:35] [INFO ] Load time of PNML (sax parser for PT used): 767 ms
[2022-05-18 10:55:35] [INFO ] Transformed 15862 places.
[2022-05-18 10:55:35] [INFO ] Transformed 25109 transitions.
[2022-05-18 10:55:35] [INFO ] Parsed PT model containing 15862 places and 25109 transitions in 993 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Normalized transition count is 24053 out of 25109 initially.
// Phase 1: matrix 24053 rows 15862 cols
[2022-05-18 10:55:38] [INFO ] Computed 1403 place invariants in 2088 ms
Incomplete random walk after 10000 steps, including 320 resets, run finished after 360 ms. (steps per millisecond=27 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :1
[2022-05-18 10:55:39] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2022-05-18 10:55:41] [INFO ] Computed 1403 place invariants in 1864 ms
[2022-05-18 10:55:43] [INFO ] [Real]Absence check using 76 positive place invariants in 400 ms returned sat
[2022-05-18 10:55:43] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 511 ms returned unsat
[2022-05-18 10:55:45] [INFO ] [Real]Absence check using 76 positive place invariants in 396 ms returned sat
[2022-05-18 10:55:46] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 768 ms returned sat
[2022-05-18 10:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:55:48] [INFO ] [Real]Absence check using state equation in 2369 ms returned unknown
[2022-05-18 10:55:50] [INFO ] [Real]Absence check using 76 positive place invariants in 388 ms returned sat
[2022-05-18 10:55:51] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 843 ms returned sat
[2022-05-18 10:55:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:55:53] [INFO ] [Real]Absence check using state equation in 2318 ms returned unknown
[2022-05-18 10:55:55] [INFO ] [Real]Absence check using 76 positive place invariants in 369 ms returned sat
[2022-05-18 10:55:56] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 836 ms returned sat
[2022-05-18 10:55:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:55:58] [INFO ] [Real]Absence check using state equation in 2369 ms returned unknown
[2022-05-18 10:56:00] [INFO ] [Real]Absence check using 76 positive place invariants in 379 ms returned sat
[2022-05-18 10:56:01] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 840 ms returned sat
[2022-05-18 10:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:03] [INFO ] [Real]Absence check using state equation in 2322 ms returned unknown
[2022-05-18 10:56:05] [INFO ] [Real]Absence check using 76 positive place invariants in 375 ms returned sat
[2022-05-18 10:56:06] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 800 ms returned sat
[2022-05-18 10:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:08] [INFO ] [Real]Absence check using state equation in 2383 ms returned unknown
[2022-05-18 10:56:10] [INFO ] [Real]Absence check using 76 positive place invariants in 376 ms returned sat
[2022-05-18 10:56:11] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 784 ms returned sat
[2022-05-18 10:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:13] [INFO ] [Real]Absence check using state equation in 2420 ms returned unknown
[2022-05-18 10:56:15] [INFO ] [Real]Absence check using 76 positive place invariants in 372 ms returned sat
[2022-05-18 10:56:16] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 880 ms returned sat
[2022-05-18 10:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:18] [INFO ] [Real]Absence check using state equation in 2296 ms returned unknown
[2022-05-18 10:56:20] [INFO ] [Real]Absence check using 76 positive place invariants in 361 ms returned sat
[2022-05-18 10:56:21] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 865 ms returned sat
[2022-05-18 10:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:23] [INFO ] [Real]Absence check using state equation in 2299 ms returned unknown
[2022-05-18 10:56:25] [INFO ] [Real]Absence check using 76 positive place invariants in 369 ms returned sat
[2022-05-18 10:56:26] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 596 ms returned unsat
[2022-05-18 10:56:28] [INFO ] [Real]Absence check using 76 positive place invariants in 390 ms returned sat
[2022-05-18 10:56:28] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 604 ms returned unsat
[2022-05-18 10:56:30] [INFO ] [Real]Absence check using 76 positive place invariants in 362 ms returned sat
[2022-05-18 10:56:31] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 606 ms returned unsat
[2022-05-18 10:56:33] [INFO ] [Real]Absence check using 76 positive place invariants in 372 ms returned sat
[2022-05-18 10:56:33] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 575 ms returned unsat
[2022-05-18 10:56:35] [INFO ] [Real]Absence check using 76 positive place invariants in 376 ms returned sat
[2022-05-18 10:56:36] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 830 ms returned sat
[2022-05-18 10:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:38] [INFO ] [Real]Absence check using state equation in 2351 ms returned unknown
[2022-05-18 10:56:40] [INFO ] [Real]Absence check using 76 positive place invariants in 379 ms returned sat
[2022-05-18 10:56:41] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 844 ms returned sat
[2022-05-18 10:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:56:43] [INFO ] [Real]Absence check using state equation in 2365 ms returned unknown
[2022-05-18 10:56:45] [INFO ] [Real]Absence check using 76 positive place invariants in 366 ms returned sat
[2022-05-18 10:56:46] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 598 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 99, 1, 1, 33, 1, 1, 1, 1, 1, 1, 1, 99, 1] Max seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 10 out of 15862 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Graph (complete) has 59447 edges and 15862 vertex of which 15820 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.58 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3165 transitions
Trivial Post-agglo rules discarded 3165 transitions
Performed 3165 trivial Post agglomeration. Transition count delta: 3165
Iterating post reduction 0 with 3165 rules applied. Total rules applied 3166 place count 15820 transition count 21944
Reduce places removed 3165 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3167 rules applied. Total rules applied 6333 place count 12655 transition count 21942
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6335 place count 12653 transition count 21942
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 6335 place count 12653 transition count 21744
Deduced a syphon composed of 198 places in 19 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 6731 place count 12455 transition count 21744
Discarding 2967 places :
Symmetric choice reduction at 3 with 2967 rule applications. Total rules 9698 place count 9488 transition count 18777
Iterating global reduction 3 with 2967 rules applied. Total rules applied 12665 place count 9488 transition count 18777
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 12665 place count 9488 transition count 18774
Deduced a syphon composed of 3 places in 15 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12671 place count 9485 transition count 18774
Discarding 987 places :
Symmetric choice reduction at 3 with 987 rule applications. Total rules 13658 place count 8498 transition count 15813
Iterating global reduction 3 with 987 rules applied. Total rules applied 14645 place count 8498 transition count 15813
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 13 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 14711 place count 8465 transition count 15780
Free-agglomeration rule (complex) applied 579 times.
Iterating global reduction 3 with 579 rules applied. Total rules applied 15290 place count 8465 transition count 17175
Reduce places removed 579 places and 0 transitions.
Iterating post reduction 3 with 579 rules applied. Total rules applied 15869 place count 7886 transition count 17175
Partial Free-agglomeration rule applied 99 times.
Drop transitions removed 99 transitions
Iterating global reduction 4 with 99 rules applied. Total rules applied 15968 place count 7886 transition count 17175
Applied a total of 15968 rules in 14488 ms. Remains 7886 /15862 variables (removed 7976) and now considering 17175/25109 (removed 7934) transitions.
Finished structural reductions, in 1 iterations. Remains : 7886/15862 places, 17175/25109 transitions.
Normalized transition count is 15609 out of 17175 initially.
// Phase 1: matrix 15609 rows 7886 cols
[2022-05-18 10:57:01] [INFO ] Computed 1361 place invariants in 716 ms
Interrupted random walk after 838988 steps, including 43926 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 3
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4483 ms. (steps per millisecond=223 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4805 resets, run finished after 4630 ms. (steps per millisecond=215 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4805 resets, run finished after 4556 ms. (steps per millisecond=219 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4477 ms. (steps per millisecond=223 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4482 ms. (steps per millisecond=223 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4491 ms. (steps per millisecond=222 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4484 ms. (steps per millisecond=223 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4495 ms. (steps per millisecond=222 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 1000000 steps, including 4805 resets, run finished after 4557 ms. (steps per millisecond=219 ) properties (out of 9) seen :1
[2022-05-18 10:58:12] [INFO ] Flow matrix only has 15609 transitions (discarded 1566 similar events)
// Phase 1: matrix 15609 rows 7886 cols
[2022-05-18 10:58:12] [INFO ] Computed 1361 place invariants in 707 ms
[2022-05-18 10:58:13] [INFO ] [Real]Absence check using 65 positive place invariants in 178 ms returned sat
[2022-05-18 10:58:14] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2022-05-18 10:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:58:22] [INFO ] [Real]Absence check using state equation in 8362 ms returned sat
[2022-05-18 10:58:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:58:23] [INFO ] [Nat]Absence check using 65 positive place invariants in 190 ms returned sat
[2022-05-18 10:58:24] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 425 ms returned sat
[2022-05-18 10:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:58:33] [INFO ] [Nat]Absence check using state equation in 8990 ms returned sat
[2022-05-18 10:58:33] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2022-05-18 10:58:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 10:58:37] [INFO ] [Nat]Added 8098 Read/Feed constraints in 4286 ms returned unsat
[2022-05-18 10:58:38] [INFO ] [Real]Absence check using 65 positive place invariants in 198 ms returned sat
[2022-05-18 10:58:39] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 461 ms returned sat
[2022-05-18 10:58:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:58:48] [INFO ] [Real]Absence check using state equation in 9476 ms returned sat
[2022-05-18 10:58:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:58:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 10:58:50] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 421 ms returned sat
[2022-05-18 10:58:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:58:59] [INFO ] [Nat]Absence check using state equation in 9233 ms returned sat
[2022-05-18 10:59:00] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1412 ms returned unsat
[2022-05-18 10:59:01] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2022-05-18 10:59:02] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 350 ms returned unsat
[2022-05-18 10:59:02] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 10:59:03] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 432 ms returned sat
[2022-05-18 10:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:59:11] [INFO ] [Real]Absence check using state equation in 8526 ms returned sat
[2022-05-18 10:59:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:59:13] [INFO ] [Nat]Absence check using 65 positive place invariants in 176 ms returned sat
[2022-05-18 10:59:13] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2022-05-18 10:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:59:22] [INFO ] [Nat]Absence check using state equation in 8801 ms returned sat
[2022-05-18 10:59:25] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2784 ms returned unsat
[2022-05-18 10:59:26] [INFO ] [Real]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 10:59:26] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 430 ms returned sat
[2022-05-18 10:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:59:36] [INFO ] [Real]Absence check using state equation in 10063 ms returned sat
[2022-05-18 10:59:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:59:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 175 ms returned sat
[2022-05-18 10:59:38] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 408 ms returned sat
[2022-05-18 10:59:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 10:59:47] [INFO ] [Nat]Absence check using state equation in 9026 ms returned sat
[2022-05-18 10:59:49] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1790 ms returned unsat
[2022-05-18 10:59:49] [INFO ] [Real]Absence check using 65 positive place invariants in 181 ms returned sat
[2022-05-18 10:59:50] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 433 ms returned sat
[2022-05-18 10:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 10:59:58] [INFO ] [Real]Absence check using state equation in 8360 ms returned sat
[2022-05-18 10:59:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 10:59:59] [INFO ] [Nat]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 11:00:00] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 407 ms returned sat
[2022-05-18 11:00:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:00:10] [INFO ] [Nat]Absence check using state equation in 9738 ms returned sat
[2022-05-18 11:00:12] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2311 ms returned unsat
[2022-05-18 11:00:13] [INFO ] [Real]Absence check using 65 positive place invariants in 182 ms returned sat
[2022-05-18 11:00:13] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 433 ms returned sat
[2022-05-18 11:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:00:23] [INFO ] [Real]Absence check using state equation in 10200 ms returned sat
[2022-05-18 11:00:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:00:25] [INFO ] [Nat]Absence check using 65 positive place invariants in 190 ms returned sat
[2022-05-18 11:00:25] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 428 ms returned sat
[2022-05-18 11:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:00:35] [INFO ] [Nat]Absence check using state equation in 9869 ms returned sat
[2022-05-18 11:00:38] [INFO ] [Nat]Added 8098 Read/Feed constraints in 3115 ms returned unsat
[2022-05-18 11:00:39] [INFO ] [Real]Absence check using 65 positive place invariants in 193 ms returned sat
[2022-05-18 11:00:39] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 444 ms returned sat
[2022-05-18 11:00:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:00:48] [INFO ] [Real]Absence check using state equation in 8611 ms returned sat
[2022-05-18 11:00:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:00:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 189 ms returned sat
[2022-05-18 11:00:50] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 418 ms returned sat
[2022-05-18 11:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:00:59] [INFO ] [Nat]Absence check using state equation in 9032 ms returned sat
[2022-05-18 11:01:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-18 11:01:05] [INFO ] [Nat]Added 8098 Read/Feed constraints in 6403 ms returned unknown
[2022-05-18 11:01:06] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2022-05-18 11:01:06] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 212 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 1, 0, 0, 0, 0, 1, 1] Max seen :[0, 0, 1, 0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 7886 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7886/7886 places, 17175/17175 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7886 transition count 17174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7885 transition count 17174
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 5 place count 7885 transition count 17171
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 8 place count 7882 transition count 17171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 11 place count 7879 transition count 17168
Iterating global reduction 3 with 3 rules applied. Total rules applied 14 place count 7879 transition count 17168
Applied a total of 14 rules in 4121 ms. Remains 7879 /7886 variables (removed 7) and now considering 17168/17175 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 7879/7886 places, 17168/17175 transitions.
Normalized transition count is 15602 out of 17168 initially.
// Phase 1: matrix 15602 rows 7879 cols
[2022-05-18 11:01:11] [INFO ] Computed 1361 place invariants in 726 ms
Interrupted random walk after 844511 steps, including 44227 resets, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4578 ms. (steps per millisecond=218 ) properties (out of 1) seen :0
[2022-05-18 11:01:46] [INFO ] Flow matrix only has 15602 transitions (discarded 1566 similar events)
// Phase 1: matrix 15602 rows 7879 cols
[2022-05-18 11:01:46] [INFO ] Computed 1361 place invariants in 738 ms
[2022-05-18 11:01:47] [INFO ] [Real]Absence check using 65 positive place invariants in 183 ms returned sat
[2022-05-18 11:01:48] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2022-05-18 11:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 11:01:56] [INFO ] [Real]Absence check using state equation in 8894 ms returned sat
[2022-05-18 11:01:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-18 11:01:58] [INFO ] [Nat]Absence check using 65 positive place invariants in 184 ms returned sat
[2022-05-18 11:01:58] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 410 ms returned sat
[2022-05-18 11:01:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-18 11:02:07] [INFO ] [Nat]Absence check using state equation in 9081 ms returned sat
[2022-05-18 11:02:07] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2022-05-18 11:02:09] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1736 ms returned unsat
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 394933 ms.

BK_STOP 1652871729580

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S32C03"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C03, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821400805"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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