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

About the Execution of Smart+red for ASLink-PT-02a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11882.888 3600000.00 3681681.00 164.50 FTTTFTTFTTFTTFTT 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.r011-oct2-167813599600030.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599600030
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 13:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K Feb 26 13:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 13:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 13:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 13:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 279K 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 ASLink-PT-02a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-02a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678719124153

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=ASLink-PT-02a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 14:52:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 14:52:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 14:52:07] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-13 14:52:07] [INFO ] Transformed 626 places.
[2023-03-13 14:52:07] [INFO ] Transformed 1008 transitions.
[2023-03-13 14:52:07] [INFO ] Found NUPN structural information;
[2023-03-13 14:52:07] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 114 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 15) seen :9
FORMULA ASLink-PT-02a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 998 rows 626 cols
[2023-03-13 14:52:08] [INFO ] Computed 118 place invariants in 36 ms
[2023-03-13 14:52:09] [INFO ] After 578ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 14:52:09] [INFO ] [Nat]Absence check using 28 positive place invariants in 10 ms returned sat
[2023-03-13 14:52:09] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 42 ms returned sat
[2023-03-13 14:52:19] [INFO ] After 10354ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-13 14:52:21] [INFO ] Deduced a trap composed of 40 places in 757 ms of which 8 ms to minimize.
[2023-03-13 14:52:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 946 ms
[2023-03-13 14:52:21] [INFO ] After 12280ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-13 14:52:22] [INFO ] After 13105ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
FORMULA ASLink-PT-02a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 31 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 614 transition count 955
Reduce places removed 43 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 100 place count 571 transition count 953
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 569 transition count 953
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 102 place count 569 transition count 911
Deduced a syphon composed of 42 places in 3 ms
Ensure Unique test removed 15 places
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 99 rules applied. Total rules applied 201 place count 512 transition count 911
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 202 place count 512 transition count 910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 203 place count 511 transition count 910
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 208 place count 506 transition count 887
Ensure Unique test removed 1 places
Iterating global reduction 5 with 6 rules applied. Total rules applied 214 place count 505 transition count 887
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 217 place count 505 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 218 place count 504 transition count 884
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 218 place count 504 transition count 882
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 223 place count 501 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 224 place count 500 transition count 874
Iterating global reduction 7 with 1 rules applied. Total rules applied 225 place count 500 transition count 874
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 226 place count 499 transition count 866
Iterating global reduction 7 with 1 rules applied. Total rules applied 227 place count 499 transition count 866
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 228 place count 498 transition count 858
Iterating global reduction 7 with 1 rules applied. Total rules applied 229 place count 498 transition count 858
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 230 place count 497 transition count 850
Iterating global reduction 7 with 1 rules applied. Total rules applied 231 place count 497 transition count 850
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 232 place count 496 transition count 842
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 496 transition count 842
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 234 place count 495 transition count 834
Iterating global reduction 7 with 1 rules applied. Total rules applied 235 place count 495 transition count 834
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 236 place count 494 transition count 826
Iterating global reduction 7 with 1 rules applied. Total rules applied 237 place count 494 transition count 826
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 259 place count 483 transition count 815
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 260 place count 483 transition count 814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 261 place count 482 transition count 814
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 262 place count 482 transition count 813
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 263 place count 481 transition count 813
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 266 place count 481 transition count 813
Applied a total of 266 rules in 387 ms. Remains 481 /626 variables (removed 145) and now considering 813/998 (removed 185) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 481/626 places, 813/998 transitions.
Incomplete random walk after 10000 steps, including 148 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 189819 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189819 steps, saw 86997 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 813 rows 481 cols
[2023-03-13 14:52:26] [INFO ] Computed 89 place invariants in 21 ms
[2023-03-13 14:52:26] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 14:52:26] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-13 14:52:26] [INFO ] [Nat]Absence check using 23 positive and 66 generalized place invariants in 119 ms returned sat
[2023-03-13 14:52:28] [INFO ] After 1869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 14:52:28] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 14:52:29] [INFO ] After 499ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 14:52:33] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 2 ms to minimize.
[2023-03-13 14:52:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 436 ms
[2023-03-13 14:52:33] [INFO ] After 5119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 518 ms.
[2023-03-13 14:52:34] [INFO ] After 7832ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 104 ms.
Support contains 31 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 813/813 transitions.
Applied a total of 0 rules in 55 ms. Remains 481 /481 variables (removed 0) and now considering 813/813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 481/481 places, 813/813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 813/813 transitions.
Applied a total of 0 rules in 34 ms. Remains 481 /481 variables (removed 0) and now considering 813/813 (removed 0) transitions.
[2023-03-13 14:52:34] [INFO ] Invariant cache hit.
[2023-03-13 14:52:36] [INFO ] Implicit Places using invariants in 2133 ms returned [1, 19, 20, 22, 32, 50, 68, 104, 131, 154, 167, 172, 173, 174, 192, 210, 264, 296, 301, 312, 313, 314, 315, 316, 345, 348, 366, 367, 368, 369, 381, 387, 400, 412, 418, 424, 430, 436, 442, 478]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 2137 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 441/481 places, 813/813 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 441 transition count 777
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 405 transition count 771
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 399 transition count 771
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 84 place count 399 transition count 754
Deduced a syphon composed of 17 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 35 rules applied. Total rules applied 119 place count 381 transition count 754
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 17 rules applied. Total rules applied 136 place count 374 transition count 744
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 146 place count 364 transition count 744
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 157 place count 353 transition count 733
Iterating global reduction 5 with 11 rules applied. Total rules applied 168 place count 353 transition count 733
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 171 place count 353 transition count 730
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 173 place count 351 transition count 728
Iterating global reduction 6 with 2 rules applied. Total rules applied 175 place count 351 transition count 728
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 177 place count 349 transition count 726
Iterating global reduction 6 with 2 rules applied. Total rules applied 179 place count 349 transition count 726
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 6 with 50 rules applied. Total rules applied 229 place count 324 transition count 701
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 230 place count 323 transition count 700
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 323 transition count 700
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 323 transition count 699
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 234 place count 323 transition count 697
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 237 place count 321 transition count 696
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 247 place count 321 transition count 686
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 258 place count 310 transition count 686
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 263 place count 310 transition count 686
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 264 place count 310 transition count 686
Applied a total of 264 rules in 98 ms. Remains 310 /441 variables (removed 131) and now considering 686/813 (removed 127) transitions.
// Phase 1: matrix 686 rows 310 cols
[2023-03-13 14:52:36] [INFO ] Computed 40 place invariants in 11 ms
[2023-03-13 14:52:37] [INFO ] Implicit Places using invariants in 942 ms returned [106, 108, 112, 119, 120, 176, 214, 215]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 963 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 302/481 places, 686/813 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 302 transition count 685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 301 transition count 685
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 300 transition count 684
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 300 transition count 684
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 298 transition count 682
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 298 transition count 680
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 296 transition count 680
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 296 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 295 transition count 679
Applied a total of 14 rules in 58 ms. Remains 295 /302 variables (removed 7) and now considering 679/686 (removed 7) transitions.
// Phase 1: matrix 679 rows 295 cols
[2023-03-13 14:52:37] [INFO ] Computed 32 place invariants in 8 ms
[2023-03-13 14:52:38] [INFO ] Implicit Places using invariants in 466 ms returned []
[2023-03-13 14:52:38] [INFO ] Invariant cache hit.
[2023-03-13 14:52:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 14:52:39] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 295/481 places, 679/813 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4600 ms. Remains : 295/481 places, 679/813 transitions.
Incomplete random walk after 10000 steps, including 198 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 79 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Finished probabilistic random walk after 102004 steps, run visited all 4 properties in 460 ms. (steps per millisecond=221 )
Probabilistic random walk after 102004 steps, saw 52318 distinct states, run finished after 462 ms. (steps per millisecond=220 ) properties seen :4
FORMULA ASLink-PT-02a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-02a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 32489 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 02a
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: 626 places, 1008 transitions, 3820 arcs.
Final Score: 39681.203
Took : 48 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( ( (! ( (! ( (tk(P29)) <= (tk(P212)) )) | (! ( (tk(P519)) <= ( 1 ) )) )) | ( (tk(P513)) <= (tk(P610)) ) ) & ( (tk(P494)) <= (tk(P313)) ) ) & ( (tk(P572)) <= (tk(P177)) ) ) & ( (tk(P286)) <= ( 1 ) ) ) | (! ( (tk(P179)) <= ( 0 ) )) ) & ( ( (! ( ( (! ( (! ( (tk(P429)) <= ( 1 ) )) & (! ( ( 1 ) <= (tk(P393)) )) )) & ( ( (tk(P596)) <= ( 0 ) ) | (! ( ( 1 ) <= (tk(P403)) )) ) ) & ( ( 1 ) <= (tk(P46)) ) )) & ( ( 1 ) <= (tk(P95)) ) ) | ( (tk(P280)) <= (tk(P206)) ) ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-01 (reachable & potential(( (! ( (tk(P198)) <= ( 0 ) )) & ( (! ( (tk(P180)) <= ( 1 ) )) | ( ( ( ( (tk(P14)) <= (tk(P296)) ) & ( ( (tk(P320)) <= (tk(P106)) ) | ( (! ( ( (tk(P594)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P370)) ) )) & (! ( ( (tk(P583)) <= (tk(P283)) ) | ( (tk(P326)) <= (tk(P470)) ) )) ) ) ) & ( ( 1 ) <= (tk(P304)) ) ) | ( (! ( ( ( ( (tk(P518)) <= (tk(P434)) ) & ( ( 1 ) <= (tk(P169)) ) ) & ( ( (tk(P465)) <= ( 1 ) ) & ( (tk(P540)) <= (tk(P535)) ) ) ) & ( ( ( 1 ) <= (tk(P573)) ) | ( ( (tk(P337)) <= (tk(P317)) ) & ( (tk(P87)) <= ( 0 ) ) ) ) )) & ( (tk(P203)) <= ( 1 ) ) ) ) ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-02 (reachable & potential(( ( ( ( 1 ) <= (tk(P304)) ) & ( ( (! ( (tk(P196)) <= ( 1 ) )) | ( ( ( (tk(P207)) <= ( 0 ) ) & ( ( (tk(P206)) <= (tk(P172)) ) & ( ( ( (tk(P373)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P448)) ) ) & (! ( ( 1 ) <= (tk(P196)) )) ) ) ) | ( ( ( ( ( ( 1 ) <= (tk(P274)) ) & ( (tk(P378)) <= (tk(P401)) ) ) & ( ( (tk(P373)) <= (tk(P407)) ) | ( ( 1 ) <= (tk(P400)) ) ) ) & ( (tk(P311)) <= (tk(P197)) ) ) | ( (tk(P382)) <= ( 0 ) ) ) ) ) | (! ( ( ( 1 ) <= (tk(P373)) ) | (! ( ( ( ( 1 ) <= (tk(P369)) ) | ( (tk(P153)) <= ( 0 ) ) ) | (! ( (tk(P85)) <= (tk(P470)) )) )) )) ) ) | (! ( ( (! ( ( 1 ) <= (tk(P370)) )) & ( (tk(P575)) <= (tk(P381)) ) ) | (! ( (! ( ( ( (tk(P320)) <= (tk(P40)) ) | ( (tk(P279)) <= (tk(P14)) ) ) | ( ( (tk(P15)) <= (tk(P16)) ) & ( ( 1 ) <= (tk(P424)) ) ) )) & ( (! ( ( 1 ) <= (tk(P86)) )) & ( ( 1 ) <= (tk(P375)) ) ) )) )) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-03 (reachable & potential(( ( 1 ) <= (tk(P58)) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-04 (reachable &!potential( ( ( (tk(P66)) <= (tk(P610)) ) & ( (! ( ( (tk(P362)) <= (tk(P348)) ) & (! ( (tk(P539)) <= ( 0 ) )) )) | (! ( (! ( (tk(P110)) <= (tk(P597)) )) | ( ( ( ( ( (tk(P229)) <= (tk(P401)) ) & (! ( (tk(P117)) <= ( 1 ) )) ) | ( ( (tk(P37)) <= (tk(P442)) ) & ( ( ( 1 ) <= (tk(P444)) ) | ( (tk(P544)) <= ( 1 ) ) ) ) ) & (! ( (tk(P524)) <= (tk(P225)) )) ) & (! ( ( 1 ) <= (tk(P337)) )) ) )) ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-05 (reachable & potential((! ( ( (tk(P366)) <= ( 0 ) ) | ( ( ( ( (! ( (tk(P159)) <= (tk(P367)) )) & ( ( 1 ) <= (tk(P535)) ) ) & ( ( (tk(P99)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P138)) ) ) ) | ( ( ( ( 1 ) <= (tk(P121)) ) | ( ( ( 1 ) <= (tk(P410)) ) | ( ( (tk(P523)) <= ( 0 ) ) & ( (tk(P354)) <= ( 0 ) ) ) ) ) | ( ( ( 1 ) <= (tk(P299)) ) | ( ( 1 ) <= (tk(P460)) ) ) ) ) & ( ( (tk(P131)) <= ( 0 ) ) | ( (tk(P82)) <= (tk(P625)) ) ) ) ))))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-06 (reachable & potential((! ( (tk(P482)) <= (tk(P227)) ))))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P473)) <= (tk(P163)) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-08 (reachable &!potential( ( (tk(P296)) <= ( 1 ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-09 (reachable & potential((! ( (tk(P465)) <= (tk(P247)) ))))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P226)) <= ( 0 ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-11 (reachable & potential(( ( ( (tk(P152)) <= (tk(P382)) ) & ( ( (! ( ( 1 ) <= (tk(P2)) )) | ( (tk(P242)) <= (tk(P599)) ) ) & (! ( ( (tk(P66)) <= (tk(P393)) ) & (! ( (! ( (tk(P506)) <= (tk(P81)) )) | (! ( (tk(P59)) <= (tk(P551)) )) )) )) ) ) & ( (tk(P334)) <= ( 0 ) ) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-12 (reachable & potential(( ( 1 ) <= (tk(P134)) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-13 (reachable &!potential( ( (tk(P576)) <= (tk(P562)) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-14 (reachable &!potential( ( ( (! ( ( (! ( ( (tk(P372)) <= (tk(P619)) ) | ( (! ( (tk(P510)) <= ( 0 ) )) | ( (tk(P134)) <= ( 0 ) ) ) )) & ( ( 1 ) <= (tk(P76)) ) ) & ( (tk(P623)) <= (tk(P621)) ) )) & (! ( ( ( 1 ) <= (tk(P469)) ) | ( ( (! ( ( ( (tk(P338)) <= ( 0 ) ) & ( (tk(P495)) <= (tk(P572)) ) ) & ( (tk(P67)) <= ( 1 ) ) )) | ( ( (! ( (tk(P580)) <= (tk(P49)) )) | (! ( ( 1 ) <= (tk(P267)) )) ) | ( ( 1 ) <= (tk(P236)) ) ) ) | ( ( ( (tk(P114)) <= (tk(P510)) ) & ( ( ( (tk(P341)) <= ( 0 ) ) | ( (tk(P211)) <= ( 0 ) ) ) | ( (tk(P240)) <= ( 0 ) ) ) ) & ( (tk(P419)) <= (tk(P531)) ) ) ) )) ) | (! ( ( ( ( ( ( ( ( (tk(P309)) <= ( 1 ) ) & ( (tk(P310)) <= (tk(P497)) ) ) | ( (tk(P566)) <= (tk(P282)) ) ) & ( (tk(P441)) <= (tk(P427)) ) ) & ( ( ( ( (tk(P147)) <= ( 1 ) ) & ( (tk(P180)) <= ( 0 ) ) ) & ( (tk(P436)) <= ( 0 ) ) ) & (! ( ( ( 1 ) <= (tk(P266)) ) | ( (tk(P88)) <= (tk(P528)) ) )) ) ) & (! ( ( (tk(P202)) <= (tk(P137)) ) | ( ( (tk(P101)) <= (tk(P432)) ) | ( ( 1 ) <= (tk(P350)) ) ) )) ) & (! ( (tk(P362)) <= (tk(P506)) )) ) & ( ( 1 ) <= (tk(P293)) ) )) )))
PROPERTY: ASLink-PT-02a-ReachabilityCardinality-15 (reachable &!potential( (! ( ( ( ( ( (tk(P599)) <= ( 1 ) ) & ( (tk(P587)) <= ( 1 ) ) ) | ( ( (! ( ( (tk(P225)) <= (tk(P308)) ) | ( (tk(P305)) <= (tk(P457)) ) )) & ( ( ( ( (tk(P289)) <= ( 0 ) ) & ( (tk(P253)) <= ( 0 ) ) ) & (! ( (tk(P163)) <= (tk(P551)) )) ) & ( ( ( (tk(P595)) <= (tk(P496)) ) | ( (tk(P534)) <= ( 1 ) ) ) & ( ( 1 ) <= (tk(P399)) ) ) ) ) | ( ( ( ( ( 1 ) <= (tk(P580)) ) & ( ( (tk(P249)) <= (tk(P36)) ) & ( ( 1 ) <= (tk(P208)) ) ) ) | ( ( 1 ) <= (tk(P342)) ) ) & ( ( (tk(P69)) <= (tk(P281)) ) | ( ( ( (tk(P239)) <= ( 0 ) ) & ( ( 1 ) <= (tk(P225)) ) ) | ( ( (tk(P382)) <= ( 0 ) ) & ( (tk(P492)) <= (tk(P343)) ) ) ) ) ) ) ) & ( ( ( ( (! ( ( 1 ) <= (tk(P14)) )) & ( (tk(P610)) <= ( 0 ) ) ) | ( (tk(P192)) <= (tk(P274)) ) ) | ( ( ( ( ( (tk(P210)) <= (tk(P424)) ) | ( (tk(P65)) <= (tk(P350)) ) ) & ( ( (tk(P285)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P529)) ) ) ) & ( (! ( (tk(P195)) <= ( 0 ) )) & ( ( (tk(P279)) <= ( 1 ) ) | ( (tk(P354)) <= (tk(P244)) ) ) ) ) & ( ( ( ( (tk(P111)) <= (tk(P5)) ) & ( (tk(P184)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P399)) ) | ( ( 1 ) <= (tk(P34)) ) ) ) | ( (tk(P402)) <= (tk(P354)) ) ) ) ) & ( ( ( ( ( ( (tk(P176)) <= (tk(P322)) ) | ( ( 1 ) <= (tk(P609)) ) ) & ( ( ( 1 ) <= (tk(P25)) ) | ( ( 1 ) <= (tk(P120)) ) ) ) & (! ( ( 1 ) <= (tk(P178)) )) ) & ( ( 1 ) <= (tk(P543)) ) ) | ( ( (tk(P488)) <= ( 0 ) ) & (! ( ( ( (tk(P281)) <= ( 1 ) ) & ( (tk(P112)) <= ( 1 ) ) ) & ( ( ( 1 ) <= (tk(P354)) ) | ( (tk(P268)) <= (tk(P185)) ) ) )) ) ) ) ) & ( (! ( ( ( ( 1 ) <= (tk(P148)) ) & ( ( ( (tk(P621)) <= ( 1 ) ) | ( ( (tk(P466)) <= (tk(P469)) ) | ( ( 1 ) <= (tk(P159)) ) ) ) | (! ( ( 1 ) <= (tk(P395)) )) ) ) | ( (tk(P146)) <= (tk(P382)) ) )) & (! ( ( ( ( 1 ) <= (tk(P418)) ) | (! ( (tk(P464)) <= (tk(P251)) )) ) | ( (tk(P252)) <= (tk(P538)) ) )) ) ))))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 4269012 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16104888 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r011-oct2-167813599600030"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02a.tgz
mv ASLink-PT-02a 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 ;