Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856421000901.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
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 r234-tall-167856421000901
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 14K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 03:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Feb 26 03:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 03:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:22 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 1679641774001

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MultiCrashLeafsetExtension-PT-S32C03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-24 07:09:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 07:09:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 07:09:36] [INFO ] Load time of PNML (sax parser for PT used): 520 ms
[2023-03-24 07:09:36] [INFO ] Transformed 15862 places.
[2023-03-24 07:09:36] [INFO ] Transformed 25109 transitions.
[2023-03-24 07:09:36] [INFO ] Parsed PT model containing 15862 places and 25109 transitions and 104566 arcs in 710 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 24053 out of 25109 initially.
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-24 07:09:38] [INFO ] Computed 1403 place invariants in 2068 ms
Incomplete random walk after 10000 steps, including 319 resets, run finished after 345 ms. (steps per millisecond=28 ) properties (out of 16) seen :6
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 71 ms. (steps per millisecond=140 ) 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 :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 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 66 ms. (steps per millisecond=151 ) 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 :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :2
[2023-03-24 07:09:39] [INFO ] Flow matrix only has 24053 transitions (discarded 1056 similar events)
// Phase 1: matrix 24053 rows 15862 cols
[2023-03-24 07:09:41] [INFO ] Computed 1403 place invariants in 1913 ms
[2023-03-24 07:09:44] [INFO ] [Real]Absence check using 76 positive place invariants in 422 ms returned sat
[2023-03-24 07:09:44] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 620 ms returned unsat
[2023-03-24 07:09:46] [INFO ] [Real]Absence check using 76 positive place invariants in 398 ms returned sat
[2023-03-24 07:09:47] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 934 ms returned sat
[2023-03-24 07:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:09:49] [INFO ] [Real]Absence check using state equation in 2040 ms returned unknown
[2023-03-24 07:09:51] [INFO ] [Real]Absence check using 76 positive place invariants in 401 ms returned sat
[2023-03-24 07:09:52] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 660 ms returned unsat
[2023-03-24 07:09:54] [INFO ] [Real]Absence check using 76 positive place invariants in 408 ms returned sat
[2023-03-24 07:09:55] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 902 ms returned sat
[2023-03-24 07:09:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:09:57] [INFO ] [Real]Absence check using state equation in 2231 ms returned unknown
[2023-03-24 07:09:59] [INFO ] [Real]Absence check using 76 positive place invariants in 402 ms returned sat
[2023-03-24 07:10:00] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 635 ms returned unsat
[2023-03-24 07:10:02] [INFO ] [Real]Absence check using 76 positive place invariants in 409 ms returned sat
[2023-03-24 07:10:03] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 864 ms returned sat
[2023-03-24 07:10:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:10:05] [INFO ] [Real]Absence check using state equation in 2119 ms returned unknown
[2023-03-24 07:10:07] [INFO ] [Real]Absence check using 76 positive place invariants in 388 ms returned sat
[2023-03-24 07:10:07] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 939 ms returned sat
[2023-03-24 07:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:10:10] [INFO ] [Real]Absence check using state equation in 2230 ms returned unknown
[2023-03-24 07:10:12] [INFO ] [Real]Absence check using 76 positive place invariants in 403 ms returned sat
[2023-03-24 07:10:12] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 627 ms returned unsat
[2023-03-24 07:10:14] [INFO ] [Real]Absence check using 76 positive place invariants in 401 ms returned sat
[2023-03-24 07:10:15] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 968 ms returned sat
[2023-03-24 07:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:10:17] [INFO ] [Real]Absence check using state equation in 2021 ms returned unknown
[2023-03-24 07:10:19] [INFO ] [Real]Absence check using 76 positive place invariants in 407 ms returned sat
[2023-03-24 07:10:20] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 921 ms returned sat
[2023-03-24 07:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:10:22] [INFO ] [Real]Absence check using state equation in 2037 ms returned unknown
[2023-03-24 07:10:24] [INFO ] [Real]Absence check using 76 positive place invariants in 400 ms returned sat
[2023-03-24 07:10:25] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 626 ms returned unsat
[2023-03-24 07:10:27] [INFO ] [Real]Absence check using 76 positive place invariants in 404 ms returned sat
[2023-03-24 07:10:27] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 620 ms returned unsat
[2023-03-24 07:10:29] [INFO ] [Real]Absence check using 76 positive place invariants in 389 ms returned sat
[2023-03-24 07:10:30] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 611 ms returned unsat
[2023-03-24 07:10:32] [INFO ] [Real]Absence check using 76 positive place invariants in 393 ms returned sat
[2023-03-24 07:10:32] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 605 ms returned unsat
[2023-03-24 07:10:34] [INFO ] [Real]Absence check using 76 positive place invariants in 403 ms returned sat
[2023-03-24 07:10:35] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 888 ms returned sat
[2023-03-24 07:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:10:37] [INFO ] [Real]Absence check using state equation in 2224 ms returned unknown
[2023-03-24 07:10:39] [INFO ] [Real]Absence check using 76 positive place invariants in 384 ms returned sat
[2023-03-24 07:10:40] [INFO ] [Real]Absence check using 76 positive and 1327 generalized place invariants in 611 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 33, 1, 1, 1, 1, 1, 1, 1, 99, 1] Max seen :[1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-13 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-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 15862 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.49 ms
Discarding 42 places :
Also discarding 0 output transitions
Drop transitions removed 3166 transitions
Trivial Post-agglo rules discarded 3166 transitions
Performed 3166 trivial Post agglomeration. Transition count delta: 3166
Iterating post reduction 0 with 3166 rules applied. Total rules applied 3167 place count 15820 transition count 21943
Reduce places removed 3166 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3167 rules applied. Total rules applied 6334 place count 12654 transition count 21942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 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 22 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 2968 places :
Symmetric choice reduction at 3 with 2968 rule applications. Total rules 9699 place count 9487 transition count 18776
Iterating global reduction 3 with 2968 rules applied. Total rules applied 12667 place count 9487 transition count 18776
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12667 place count 9487 transition count 18772
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 12675 place count 9483 transition count 18772
Discarding 988 places :
Symmetric choice reduction at 3 with 988 rule applications. Total rules 13663 place count 8495 transition count 15808
Iterating global reduction 3 with 988 rules applied. Total rules applied 14651 place count 8495 transition count 15808
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 18 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 14717 place count 8462 transition count 15775
Free-agglomeration rule (complex) applied 578 times.
Iterating global reduction 3 with 578 rules applied. Total rules applied 15295 place count 8462 transition count 17173
Reduce places removed 578 places and 0 transitions.
Iterating post reduction 3 with 578 rules applied. Total rules applied 15873 place count 7884 transition count 17173
Partial Free-agglomeration rule applied 66 times.
Drop transitions removed 66 transitions
Iterating global reduction 4 with 66 rules applied. Total rules applied 15939 place count 7884 transition count 17173
Applied a total of 15939 rules in 12858 ms. Remains 7884 /15862 variables (removed 7978) and now considering 17173/25109 (removed 7936) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12865 ms. Remains : 7884/15862 places, 17173/25109 transitions.
Normalized transition count is 15607 out of 17173 initially.
// Phase 1: matrix 15607 rows 7884 cols
[2023-03-24 07:10:54] [INFO ] Computed 1361 place invariants in 787 ms
Interrupted random walk after 835319 steps, including 43742 resets, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen 2
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 4603 ms. (steps per millisecond=217 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4479 ms. (steps per millisecond=223 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4533 ms. (steps per millisecond=220 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4587 ms. (steps per millisecond=218 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4476 ms. (steps per millisecond=223 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1000001 steps, including 4805 resets, run finished after 4446 ms. (steps per millisecond=224 ) properties (out of 6) seen :1
[2023-03-24 07:11:51] [INFO ] Flow matrix only has 15607 transitions (discarded 1566 similar events)
// Phase 1: matrix 15607 rows 7884 cols
[2023-03-24 07:11:52] [INFO ] Computed 1361 place invariants in 747 ms
[2023-03-24 07:11:53] [INFO ] [Real]Absence check using 65 positive place invariants in 170 ms returned sat
[2023-03-24 07:11:53] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 463 ms returned sat
[2023-03-24 07:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:12:03] [INFO ] [Real]Absence check using state equation in 10358 ms returned sat
[2023-03-24 07:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 07:12:05] [INFO ] [Nat]Absence check using 65 positive place invariants in 178 ms returned sat
[2023-03-24 07:12:05] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 434 ms returned sat
[2023-03-24 07:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 07:12:15] [INFO ] [Nat]Absence check using state equation in 9991 ms returned sat
[2023-03-24 07:12:16] [INFO ] State equation strengthened by 8098 read => feed constraints.
[2023-03-24 07:12:17] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1135 ms returned unsat
[2023-03-24 07:12:18] [INFO ] [Real]Absence check using 65 positive place invariants in 165 ms returned sat
[2023-03-24 07:12:18] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 449 ms returned sat
[2023-03-24 07:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:12:28] [INFO ] [Real]Absence check using state equation in 10323 ms returned sat
[2023-03-24 07:12:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 07:12:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2023-03-24 07:12:30] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 431 ms returned sat
[2023-03-24 07:12:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 07:12:43] [INFO ] [Nat]Absence check using state equation in 12489 ms returned sat
[2023-03-24 07:12:44] [INFO ] [Nat]Added 8098 Read/Feed constraints in 1594 ms returned unsat
[2023-03-24 07:12:45] [INFO ] [Real]Absence check using 65 positive place invariants in 177 ms returned sat
[2023-03-24 07:12:45] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 461 ms returned sat
[2023-03-24 07:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:12:56] [INFO ] [Real]Absence check using state equation in 10615 ms returned sat
[2023-03-24 07:12:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 07:12:57] [INFO ] [Nat]Absence check using 65 positive place invariants in 191 ms returned sat
[2023-03-24 07:12:58] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 462 ms returned sat
[2023-03-24 07:12:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 07:13:09] [INFO ] [Nat]Absence check using state equation in 11007 ms returned sat
[2023-03-24 07:13:12] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-24 07:13:13] [INFO ] [Nat]Added 8098 Read/Feed constraints in 4139 ms returned unsat
[2023-03-24 07:13:14] [INFO ] [Real]Absence check using 65 positive place invariants in 167 ms returned sat
[2023-03-24 07:13:14] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 452 ms returned sat
[2023-03-24 07:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:13:24] [INFO ] [Real]Absence check using state equation in 10152 ms returned sat
[2023-03-24 07:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 07:13:26] [INFO ] [Nat]Absence check using 65 positive place invariants in 168 ms returned sat
[2023-03-24 07:13:26] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 425 ms returned sat
[2023-03-24 07:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 07:13:36] [INFO ] [Nat]Absence check using state equation in 10091 ms returned sat
[2023-03-24 07:13:38] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2191 ms returned unsat
[2023-03-24 07:13:39] [INFO ] [Real]Absence check using 65 positive place invariants in 165 ms returned sat
[2023-03-24 07:13:40] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2023-03-24 07:13:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 07:13:50] [INFO ] [Real]Absence check using state equation in 9809 ms returned sat
[2023-03-24 07:13:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 07:13:51] [INFO ] [Nat]Absence check using 65 positive place invariants in 168 ms returned sat
[2023-03-24 07:13:51] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 457 ms returned sat
[2023-03-24 07:13:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 07:14:02] [INFO ] [Nat]Absence check using state equation in 10724 ms returned sat
[2023-03-24 07:14:04] [INFO ] [Nat]Added 8098 Read/Feed constraints in 2023 ms returned unsat
[2023-03-24 07:14:05] [INFO ] [Real]Absence check using 65 positive place invariants in 160 ms returned sat
[2023-03-24 07:14:05] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 228 ms returned unsat
Current structural bounds on expressions (after SMT) : [0, 0, 0, 0, 0, 1] Max seen :[0, 0, 0, 0, 0, 1]
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-08 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-03 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S32C03-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 270240 ms.
ITS solved all properties within timeout

BK_STOP 1679642046758

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="marciexred"
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-5348"
echo " Executing tool marciexred"
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 r234-tall-167856421000901"
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 ;