fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r235-tall-167856421900534
Last Updated
May 14, 2023

About the Execution of Smart+red for LeafsetExtension-PT-S64C3

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8551.752 3600000.00 3663707.00 8203.80 TFTF?TTF?FTFFTFT normal

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.r235-tall-167856421900534.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 smartxred
Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-tall-167856421900534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Feb 25 16:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 16:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 31K Feb 25 16:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 194K Feb 25 16:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 14M 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678667329052

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 00:28:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 00:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:28:51] [INFO ] Load time of PNML (sax parser for PT used): 472 ms
[2023-03-13 00:28:51] [INFO ] Transformed 21462 places.
[2023-03-13 00:28:51] [INFO ] Transformed 21129 transitions.
[2023-03-13 00:28:51] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 616 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 387 resets, run finished after 706 ms. (steps per millisecond=14 ) properties (out of 16) seen :3
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 13) seen :1
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 21129 rows 21462 cols
[2023-03-13 00:28:55] [INFO ] Computed 333 place invariants in 2641 ms
[2023-03-13 00:29:01] [INFO ] After 5674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-13 00:29:06] [INFO ] [Nat]Absence check using 67 positive place invariants in 58 ms returned sat
[2023-03-13 00:29:07] [INFO ] [Nat]Absence check using 67 positive and 266 generalized place invariants in 960 ms returned sat
[2023-03-13 00:29:26] [INFO ] After 13471ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :6
[2023-03-13 00:29:26] [INFO ] After 13514ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :6
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 00:29:26] [INFO ] After 25078ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :6
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 291 out of 21462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Graph (complete) has 42457 edges and 21462 vertex of which 12342 are kept as prefixes of interest. Removing 9120 places using SCC suffix rule.39 ms
Discarding 9120 places :
Also discarding 2990 output transitions
Drop transitions removed 2990 transitions
Drop transitions removed 1937 transitions
Reduce isomorphic transitions removed 1937 transitions.
Drop transitions removed 3515 transitions
Trivial Post-agglo rules discarded 3515 transitions
Performed 3515 trivial Post agglomeration. Transition count delta: 3515
Iterating post reduction 0 with 5452 rules applied. Total rules applied 5453 place count 12342 transition count 12687
Reduce places removed 3516 places and 0 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 1 with 3563 rules applied. Total rules applied 9016 place count 8826 transition count 12640
Reduce places removed 47 places and 0 transitions.
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Iterating post reduction 2 with 104 rules applied. Total rules applied 9120 place count 8779 transition count 12583
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 3 with 57 rules applied. Total rules applied 9177 place count 8722 transition count 12583
Performed 119 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 119 Pre rules applied. Total rules applied 9177 place count 8722 transition count 12464
Deduced a syphon composed of 119 places in 8 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 9415 place count 8603 transition count 12464
Discarding 2096 places :
Symmetric choice reduction at 4 with 2096 rule applications. Total rules 11511 place count 6507 transition count 10368
Iterating global reduction 4 with 2096 rules applied. Total rules applied 13607 place count 6507 transition count 10368
Discarding 1946 places :
Symmetric choice reduction at 4 with 1946 rule applications. Total rules 15553 place count 4561 transition count 8422
Iterating global reduction 4 with 1946 rules applied. Total rules applied 17499 place count 4561 transition count 8422
Free-agglomeration rule (complex) applied 91 times.
Iterating global reduction 4 with 91 rules applied. Total rules applied 17590 place count 4561 transition count 8331
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 4 with 91 rules applied. Total rules applied 17681 place count 4470 transition count 8331
Partial Free-agglomeration rule applied 753 times.
Drop transitions removed 753 transitions
Iterating global reduction 5 with 753 rules applied. Total rules applied 18434 place count 4470 transition count 8331
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 5 with 9 rules applied. Total rules applied 18443 place count 4461 transition count 8331
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 18450 place count 4461 transition count 8324
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 18457 place count 4454 transition count 8324
Applied a total of 18457 rules in 6140 ms. Remains 4454 /21462 variables (removed 17008) and now considering 8324/21129 (removed 12805) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6142 ms. Remains : 4454/21462 places, 8324/21129 transitions.
Incomplete random walk after 10000 steps, including 758 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 7) seen :2
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:29:33] [INFO ] Flow matrix only has 7885 transitions (discarded 439 similar events)
// Phase 1: matrix 7885 rows 4454 cols
[2023-03-13 00:29:33] [INFO ] Computed 101 place invariants in 127 ms
[2023-03-13 00:29:34] [INFO ] After 725ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:29:34] [INFO ] [Nat]Absence check using 0 positive and 101 generalized place invariants in 38 ms returned sat
[2023-03-13 00:29:39] [INFO ] After 4657ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:29:41] [INFO ] After 6827ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1459 ms.
[2023-03-13 00:29:43] [INFO ] After 9214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 29 ms.
Support contains 161 out of 4454 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4454/4454 places, 8324/8324 transitions.
Graph (complete) has 19790 edges and 4454 vertex of which 3924 are kept as prefixes of interest. Removing 530 places using SCC suffix rule.4 ms
Discarding 530 places :
Also discarding 33 output transitions
Drop transitions removed 33 transitions
Drop transitions removed 465 transitions
Reduce isomorphic transitions removed 465 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 492 rules applied. Total rules applied 493 place count 3924 transition count 7799
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 520 place count 3897 transition count 7799
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 541 place count 3876 transition count 7778
Iterating global reduction 2 with 21 rules applied. Total rules applied 562 place count 3876 transition count 7778
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 564 place count 3874 transition count 7776
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 3874 transition count 7776
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 3874 transition count 7774
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 570 place count 3872 transition count 7774
Partial Free-agglomeration rule applied 301 times.
Drop transitions removed 301 transitions
Iterating global reduction 3 with 301 rules applied. Total rules applied 871 place count 3872 transition count 7774
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 877 place count 3866 transition count 7774
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 896 place count 3847 transition count 7755
Iterating global reduction 4 with 19 rules applied. Total rules applied 915 place count 3847 transition count 7755
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 920 place count 3847 transition count 7750
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 925 place count 3842 transition count 7750
Applied a total of 925 rules in 3151 ms. Remains 3842 /4454 variables (removed 612) and now considering 7750/8324 (removed 574) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3151 ms. Remains : 3842/4454 places, 7750/8324 transitions.
Incomplete random walk after 10000 steps, including 780 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 5) seen :3
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA LeafsetExtension-PT-S64C3-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:29:46] [INFO ] Flow matrix only has 6866 transitions (discarded 884 similar events)
// Phase 1: matrix 6866 rows 3842 cols
[2023-03-13 00:29:46] [INFO ] Computed 100 place invariants in 65 ms
[2023-03-13 00:29:47] [INFO ] After 406ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:29:47] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 36 ms returned sat
[2023-03-13 00:29:51] [INFO ] After 3201ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:29:52] [INFO ] After 4385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 969 ms.
[2023-03-13 00:29:53] [INFO ] After 5892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 8 ms.
Support contains 124 out of 3842 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3842/3842 places, 7750/7750 transitions.
Graph (complete) has 17708 edges and 3842 vertex of which 3623 are kept as prefixes of interest. Removing 219 places using SCC suffix rule.4 ms
Discarding 219 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Drop transitions removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 202 rules applied. Total rules applied 203 place count 3623 transition count 7537
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 206 place count 3620 transition count 7537
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 211 place count 3615 transition count 7532
Iterating global reduction 2 with 5 rules applied. Total rules applied 216 place count 3615 transition count 7532
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 3615 transition count 7531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 3614 transition count 7531
Partial Free-agglomeration rule applied 163 times.
Drop transitions removed 163 transitions
Iterating global reduction 3 with 163 rules applied. Total rules applied 381 place count 3614 transition count 7531
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 3 with 6 rules applied. Total rules applied 387 place count 3608 transition count 7531
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 393 place count 3602 transition count 7525
Iterating global reduction 4 with 6 rules applied. Total rules applied 399 place count 3602 transition count 7525
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 403 place count 3602 transition count 7521
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 407 place count 3598 transition count 7521
Applied a total of 407 rules in 1965 ms. Remains 3598 /3842 variables (removed 244) and now considering 7521/7750 (removed 229) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1965 ms. Remains : 3598/3842 places, 7521/7750 transitions.
Incomplete random walk after 10000 steps, including 794 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 21200 steps, run timeout after 3001 ms. (steps per millisecond=7 ) properties seen :{}
Probabilistic random walk after 21200 steps, saw 11273 distinct states, run finished after 3003 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:29:58] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
// Phase 1: matrix 6443 rows 3598 cols
[2023-03-13 00:29:58] [INFO ] Computed 100 place invariants in 54 ms
[2023-03-13 00:29:59] [INFO ] After 462ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:29:59] [INFO ] [Nat]Absence check using 0 positive and 100 generalized place invariants in 36 ms returned sat
[2023-03-13 00:30:02] [INFO ] After 3012ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:30:03] [INFO ] After 4199ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 936 ms.
[2023-03-13 00:30:04] [INFO ] After 5650ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 124 out of 3598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 329 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 329 ms. Remains : 3598/3598 places, 7521/7521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3598/3598 places, 7521/7521 transitions.
Applied a total of 0 rules in 321 ms. Remains 3598 /3598 variables (removed 0) and now considering 7521/7521 (removed 0) transitions.
[2023-03-13 00:30:05] [INFO ] Flow matrix only has 6443 transitions (discarded 1078 similar events)
[2023-03-13 00:30:05] [INFO ] Invariant cache hit.
[2023-03-13 00:30:08] [INFO ] Implicit Places using invariants in 2917 ms returned [38, 78, 115, 225, 338, 375, 483, 522, 560, 637, 707, 747, 857, 894, 964, 1001, 1077, 1186, 1297, 1336, 1410, 1599, 1711, 1746, 1782, 1816, 1889, 1965, 2039, 2111, 2114, 2148, 2187, 2225, 2260, 2263, 2298, 2301, 2335, 2342, 2376, 2455, 2458, 2493, 2532, 2568, 2602, 2674, 2717, 2789, 2792, 2826, 2866, 2871, 2905, 2941, 2975, 3011, 3045, 3120, 3160, 3195, 3234, 3308, 3312, 3346, 3382, 3416, 3419, 3455, 3493, 3529]
Discarding 72 places :
Implicit Place search using SMT only with invariants took 2923 ms to find 72 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 3526/3598 places, 7521/7521 transitions.
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 13 Pre rules applied. Total rules applied 0 place count 3526 transition count 7508
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 3513 transition count 7508
Discarding 1961 places :
Symmetric choice reduction at 0 with 1961 rule applications. Total rules 1987 place count 1552 transition count 5547
Iterating global reduction 0 with 1961 rules applied. Total rules applied 3948 place count 1552 transition count 5547
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3986 place count 1514 transition count 5509
Iterating global reduction 0 with 38 rules applied. Total rules applied 4024 place count 1514 transition count 5509
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 4066 place count 1472 transition count 5467
Iterating global reduction 0 with 42 rules applied. Total rules applied 4108 place count 1472 transition count 5467
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 0 with 92 rules applied. Total rules applied 4200 place count 1426 transition count 5421
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 4232 place count 1426 transition count 5389
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 4264 place count 1394 transition count 5389
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 4265 place count 1394 transition count 5389
Applied a total of 4265 rules in 824 ms. Remains 1394 /3526 variables (removed 2132) and now considering 5389/7521 (removed 2132) transitions.
[2023-03-13 00:30:09] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
// Phase 1: matrix 3115 rows 1394 cols
[2023-03-13 00:30:09] [INFO ] Computed 28 place invariants in 26 ms
[2023-03-13 00:30:10] [INFO ] Implicit Places using invariants in 846 ms returned []
[2023-03-13 00:30:10] [INFO ] Flow matrix only has 3115 transitions (discarded 2274 similar events)
[2023-03-13 00:30:10] [INFO ] Invariant cache hit.
[2023-03-13 00:30:20] [INFO ] Implicit Places using invariants and state equation in 10053 ms returned [41, 44, 47, 50, 90, 96, 107, 143, 146, 153, 189, 196, 201, 208, 211, 247, 249, 254, 297, 300, 303, 339, 342, 351, 354, 361, 398, 438, 441, 445, 450, 494, 501, 509, 548, 551, 592, 595, 634, 708, 793, 879, 937, 1195, 1236, 1282, 1364]
Discarding 47 places :
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Implicit Place search using SMT with State Equation took 10913 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1347/3598 places, 5241/7521 transitions.
Graph (complete) has 5009 edges and 1347 vertex of which 1199 are kept as prefixes of interest. Removing 148 places using SCC suffix rule.2 ms
Discarding 148 places :
Also discarding 0 output transitions
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 14 Pre rules applied. Total rules applied 1 place count 1199 transition count 5227
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 29 place count 1185 transition count 5227
Discarding 719 places :
Symmetric choice reduction at 0 with 719 rule applications. Total rules 748 place count 466 transition count 4508
Iterating global reduction 0 with 719 rules applied. Total rules applied 1467 place count 466 transition count 4508
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 1503 place count 448 transition count 4490
Free-agglomeration rule (complex) applied 32 times.
Iterating global reduction 0 with 32 rules applied. Total rules applied 1535 place count 448 transition count 4458
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 1567 place count 416 transition count 4458
Applied a total of 1567 rules in 243 ms. Remains 416 /1347 variables (removed 931) and now considering 4458/5241 (removed 783) transitions.
[2023-03-13 00:30:20] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
// Phase 1: matrix 2036 rows 416 cols
[2023-03-13 00:30:20] [INFO ] Computed 28 place invariants in 18 ms
[2023-03-13 00:30:20] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-13 00:30:20] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-13 00:30:20] [INFO ] Invariant cache hit.
[2023-03-13 00:30:21] [INFO ] Implicit Places using invariants and state equation in 920 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 416/3598 places, 4458/7521 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 16528 ms. Remains : 416/3598 places, 4458/7521 transitions.
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 1332 ms. (steps per millisecond=7 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 145401 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145401 steps, saw 53560 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-13 00:30:26] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-13 00:30:26] [INFO ] Invariant cache hit.
[2023-03-13 00:30:26] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:30:26] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-13 00:30:26] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:30:27] [INFO ] After 803ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2023-03-13 00:30:27] [INFO ] After 1093ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 124 out of 416 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 76 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 416/416 places, 4458/4458 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 416/416 places, 4458/4458 transitions.
Applied a total of 0 rules in 76 ms. Remains 416 /416 variables (removed 0) and now considering 4458/4458 (removed 0) transitions.
[2023-03-13 00:30:27] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-13 00:30:27] [INFO ] Invariant cache hit.
[2023-03-13 00:30:27] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-13 00:30:27] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-13 00:30:27] [INFO ] Invariant cache hit.
[2023-03-13 00:30:28] [INFO ] Implicit Places using invariants and state equation in 909 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
[2023-03-13 00:30:29] [INFO ] Redundant transitions in 412 ms returned []
[2023-03-13 00:30:29] [INFO ] Flow matrix only has 2036 transitions (discarded 2422 similar events)
[2023-03-13 00:30:29] [INFO ] Invariant cache hit.
[2023-03-13 00:30:30] [INFO ] Dead Transitions using invariants and state equation in 1142 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2918 ms. Remains : 416/416 places, 4458/4458 transitions.
Drop transitions removed 1259 transitions
Ensure Unique test removed 1196 transitions
Reduce isomorphic transitions removed 2455 transitions.
Iterating post reduction 0 with 2455 rules applied. Total rules applied 2455 place count 416 transition count 2003
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 26 Pre rules applied. Total rules applied 2455 place count 416 transition count 1977
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 52 rules applied. Total rules applied 2507 place count 390 transition count 1977
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 2509 place count 388 transition count 1925
Iterating global reduction 1 with 2 rules applied. Total rules applied 2511 place count 388 transition count 1925
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 2515 place count 386 transition count 1923
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 2524 place count 386 transition count 1914
Free-agglomeration rule (complex) applied 96 times.
Iterating global reduction 1 with 96 rules applied. Total rules applied 2620 place count 386 transition count 1818
Reduce places removed 96 places and 0 transitions.
Iterating post reduction 1 with 96 rules applied. Total rules applied 2716 place count 290 transition count 1818
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 2726 place count 290 transition count 1808
Partial Free-agglomeration rule applied 444 times.
Drop transitions removed 444 transitions
Iterating global reduction 2 with 444 rules applied. Total rules applied 3170 place count 290 transition count 1808
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 2 with 13 rules applied. Total rules applied 3183 place count 290 transition count 1795
Applied a total of 3183 rules in 82 ms. Remains 290 /416 variables (removed 126) and now considering 1795/4458 (removed 2663) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1795 rows 290 cols
[2023-03-13 00:30:30] [INFO ] Computed 28 place invariants in 7 ms
[2023-03-13 00:30:30] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 00:30:30] [INFO ] [Nat]Absence check using 0 positive and 28 generalized place invariants in 4 ms returned sat
[2023-03-13 00:30:31] [INFO ] After 588ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 00:30:31] [INFO ] After 974ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 282 ms.
[2023-03-13 00:30:31] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 00:30:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-13 00:30:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 416 places, 4458 transitions and 21059 arcs took 23 ms.
[2023-03-13 00:30:32] [INFO ] Flatten gal took : 337 ms
Total runtime 101821 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running LeafsetExtension (PT), instance S64C3
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 416 places, 4458 transitions, 21059 arcs.
Final Score: 66511.736
Took : 95 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: LeafsetExtension-PT-S64C3-ReachabilityCardinality-04 (reachable & potential(( ( (! ( (tk(P366)) <= (tk(P22)) )) | ( ( ( (! ( (tk(P109)) <= ( 1 ) )) | ( (tk(P138)) <= ( 2 ) ) ) | ( ( (tk(P126)) <= (tk(P101)) ) | ( ( (! ( (tk(P41)) <= ( 0 ) )) & ( (! ( ( 1 ) <= (tk(P388)) )) | (! ( (tk(P174)) <= (tk(P416)) )) ) ) | ( ( ( ( (tk(P263)) <= (tk(P65)) ) | ( ( ( 2 ) <= (tk(P27)) ) | ( ( 3 ) <= (tk(P351)) ) ) ) & ( ( ( 1 ) <= (tk(P287)) ) | ( ( ( 3 ) <= (tk(P199)) ) | ( (tk(P190)) <= (tk(P295)) ) ) ) ) & ( ( ( ( (tk(P203)) <= ( 0 ) ) | ( (tk(P85)) <= ( 1 ) ) ) | ( ( (tk(P327)) <= (tk(P18)) ) | ( ( ( 3 ) <= (tk(P61)) ) | ( ( (tk(P361)) <= ( 0 ) ) & ( ( 3 ) <= (tk(P172)) ) ) ) ) ) & ( (! ( (tk(P283)) <= (tk(P374)) )) | ( ( (tk(P210)) <= (tk(P71)) ) | ( ( ( ( 1 ) <= (tk(P116)) ) & ( ( ( 2 ) <= (tk(P356)) ) | ( ( 3 ) <= (tk(P265)) ) ) ) & ( ( ( (tk(P259)) <= (tk(P387)) ) | ( ( 1 ) <= (tk(P132)) ) ) & ( ( ( 1 ) <= (tk(P47)) ) | ( (tk(P103)) <= (tk(P11)) ) ) ) ) ) ) ) ) ) ) ) & ( ( ( (! ( (tk(P140)) <= ( 2 ) )) | ( ( 2 ) <= (tk(P159)) ) ) | ( (! ( ( 3 ) <= (tk(P292)) )) | (! ( (tk(P297)) <= (tk(P237)) )) ) ) | ( ( (! ( ( 3 ) <= (tk(P224)) )) | ( ( (tk(P288)) <= ( 1 ) ) & ( (! ( ( 3 ) <= (tk(P95)) )) | ( (! ( (tk(P74)) <= (tk(P321)) )) | (! ( (tk(P239)) <= (tk(P9)) )) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P269)) )) & (! ( ( 1 ) <= (tk(P232)) )) ) | ( (! ( (tk(P86)) <= ( 0 ) )) & (! ( (tk(P243)) <= ( 0 ) )) ) ) ) ) ) ) & ( (! ( (tk(P244)) <= ( 2 ) )) | ( ( ( ( ( 2 ) <= (tk(P348)) ) | ( ( ( 3 ) <= (tk(P370)) ) | ( (tk(P152)) <= ( 1 ) ) ) ) & ( (! ( (tk(P32)) <= ( 1 ) )) | ( (! ( (tk(P314)) <= (tk(P220)) )) & ( ( ( 1 ) <= (tk(P81)) ) & ( (tk(P226)) <= (tk(P147)) ) ) ) ) ) | ( ( (! ( (tk(P7)) <= ( 3 ) )) & (! ( (tk(P194)) <= ( 1 ) )) ) & ( (! ( ( 1 ) <= (tk(P178)) )) & ( (! ( (tk(P114)) <= (tk(P25)) )) & (! ( (tk(P308)) <= (tk(P363)) )) ) ) ) ) ) )))
PROPERTY: LeafsetExtension-PT-S64C3-ReachabilityCardinality-08 (reachable & potential(( ( ( (tk(P168)) <= (tk(P135)) ) & ( ( ( (! ( (tk(P352)) <= ( 0 ) )) & ( (tk(P378)) <= ( 1 ) ) ) & ( (! ( ( 1 ) <= (tk(P278)) )) & ( ( ( ( 3 ) <= (tk(P162)) ) | ( (! ( (tk(P350)) <= ( 3 ) )) & ( ( (tk(P230)) <= ( 3 ) ) | ( ( (tk(P304)) <= (tk(P202)) ) & ( ( (tk(P215)) <= ( 0 ) ) & ( ( ( 1 ) <= (tk(P331)) ) | ( ( 2 ) <= (tk(P211)) ) ) ) ) ) ) ) & ( ( (tk(P120)) <= ( 0 ) ) | ( (tk(P383)) <= (tk(P336)) ) ) ) ) ) | ( ( ( (tk(P188)) <= (tk(P325)) ) & ( ( (tk(P385)) <= ( 1 ) ) & ( ( ( 3 ) <= (tk(P88)) ) | ( ( (! ( (tk(P346)) <= ( 1 ) )) & (! ( (tk(P380)) <= (tk(P250)) )) ) & ( (! ( (tk(P34)) <= ( 1 ) )) & ( ( ( 3 ) <= (tk(P52)) ) | (! ( (tk(P24)) <= (tk(P73)) )) ) ) ) ) ) ) & ( ( ( ( 3 ) <= (tk(P56)) ) | ( ( 2 ) <= (tk(P258)) ) ) & ( ( ( (tk(P157)) <= (tk(P5)) ) | ( ( ( 3 ) <= (tk(P129)) ) | ( (tk(P180)) <= ( 0 ) ) ) ) & ( (! ( ( 3 ) <= (tk(P320)) )) | ( (tk(P58)) <= (tk(P338)) ) ) ) ) ) ) ) | ( ( ( (! ( (tk(P77)) <= (tk(P261)) )) & (! ( (tk(P205)) <= (tk(P142)) )) ) & ( (! ( ( 1 ) <= (tk(P36)) )) & ( (! ( (tk(P369)) <= (tk(P184)) )) & ( (! ( (tk(P273)) <= ( 1 ) )) | ( (tk(P342)) <= ( 0 ) ) ) ) ) ) | ( ( ( (tk(P123)) <= (tk(P153)) ) & ( (tk(P166)) <= ( 2 ) ) ) & ( ( ( 3 ) <= (tk(P316)) ) & ( ( (tk(P255)) <= ( 2 ) ) | ( ( ( 1 ) <= (tk(P248)) ) & (! ( (tk(P253)) <= (tk(P299)) )) ) ) ) ) ) )))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 7579516 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16083264 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 ReachabilityCardinality -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="LeafsetExtension-PT-S64C3"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is LeafsetExtension-PT-S64C3, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r235-tall-167856421900534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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