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

About the Execution of LTSMin+red for ASLink-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16007.951 3600000.00 14066437.00 51.80 TTTFTF?T?TT?FF?T 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.r009-oct2-167813597300046.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 ltsminxred
Input is ASLink-PT-03a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597300046
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 768K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 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 26K 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.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 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 357K 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-03a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-03a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678602882913

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=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:34:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 06:34:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:34:45] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2023-03-12 06:34:45] [INFO ] Transformed 821 places.
[2023-03-12 06:34:45] [INFO ] Transformed 1281 transitions.
[2023-03-12 06:34:45] [INFO ] Found NUPN structural information;
[2023-03-12 06:34:45] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
FORMULA ASLink-PT-03a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 91 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 14) seen :3
FORMULA ASLink-PT-03a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 11) seen :1
FORMULA ASLink-PT-03a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-12 06:34:47] [INFO ] Computed 156 place invariants in 42 ms
[2023-03-12 06:34:48] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-12 06:34:48] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 44 ms returned sat
[2023-03-12 06:34:48] [INFO ] After 609ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 06:34:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-12 06:34:48] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 42 ms returned sat
[2023-03-12 06:35:01] [INFO ] After 12622ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-12 06:35:02] [INFO ] Deduced a trap composed of 127 places in 433 ms of which 11 ms to minimize.
[2023-03-12 06:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 587 ms
[2023-03-12 06:35:03] [INFO ] Deduced a trap composed of 30 places in 250 ms of which 1 ms to minimize.
[2023-03-12 06:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 377 ms
[2023-03-12 06:35:13] [INFO ] After 24585ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 06:35:13] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
FORMULA ASLink-PT-03a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-03a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 247 ms.
Support contains 34 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 803 transition count 1203
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 149 place count 738 transition count 1202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 737 transition count 1202
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 150 place count 737 transition count 1137
Deduced a syphon composed of 65 places in 6 ms
Ensure Unique test removed 26 places
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 306 place count 646 transition count 1137
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 307 place count 646 transition count 1136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 645 transition count 1136
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 314 place count 639 transition count 1107
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 321 place count 638 transition count 1107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 327 place count 637 transition count 1102
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 330 place count 634 transition count 1102
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 331 place count 633 transition count 1094
Iterating global reduction 7 with 1 rules applied. Total rules applied 332 place count 633 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 333 place count 632 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 334 place count 632 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 335 place count 631 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 336 place count 631 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 337 place count 630 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 338 place count 630 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 339 place count 629 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 340 place count 629 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 341 place count 628 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 342 place count 628 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 343 place count 627 transition count 1046
Iterating global reduction 7 with 1 rules applied. Total rules applied 344 place count 627 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 345 place count 626 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 346 place count 626 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 347 place count 625 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 348 place count 625 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 349 place count 624 transition count 1022
Iterating global reduction 7 with 1 rules applied. Total rules applied 350 place count 624 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 351 place count 623 transition count 1014
Iterating global reduction 7 with 1 rules applied. Total rules applied 352 place count 623 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 353 place count 622 transition count 1006
Iterating global reduction 7 with 1 rules applied. Total rules applied 354 place count 622 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 355 place count 621 transition count 998
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 621 transition count 998
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 357 place count 620 transition count 990
Iterating global reduction 7 with 1 rules applied. Total rules applied 358 place count 620 transition count 990
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 359 place count 619 transition count 982
Iterating global reduction 7 with 1 rules applied. Total rules applied 360 place count 619 transition count 982
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 400 place count 599 transition count 962
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 404 place count 599 transition count 958
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 408 place count 595 transition count 958
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 411 place count 595 transition count 958
Applied a total of 411 rules in 567 ms. Remains 595 /821 variables (removed 226) and now considering 958/1268 (removed 310) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 568 ms. Remains : 595/821 places, 958/1268 transitions.
Incomplete random walk after 10000 steps, including 124 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :1
FORMULA ASLink-PT-03a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :2
FORMULA ASLink-PT-03a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 4 properties.
// Phase 1: matrix 958 rows 595 cols
[2023-03-12 06:35:14] [INFO ] Computed 110 place invariants in 19 ms
[2023-03-12 06:35:14] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:35:14] [INFO ] [Nat]Absence check using 29 positive place invariants in 5 ms returned sat
[2023-03-12 06:35:14] [INFO ] [Nat]Absence check using 29 positive and 81 generalized place invariants in 19 ms returned sat
[2023-03-12 06:35:18] [INFO ] After 3151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 06:35:18] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 06:35:27] [INFO ] After 9502ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 06:35:29] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 2 ms to minimize.
[2023-03-12 06:35:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 475 ms
[2023-03-12 06:35:29] [INFO ] After 11118ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 9269 ms.
[2023-03-12 06:35:38] [INFO ] After 23700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 127 ms.
Support contains 29 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 958/958 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 595 transition count 957
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 594 transition count 957
Applied a total of 2 rules in 21 ms. Remains 594 /595 variables (removed 1) and now considering 957/958 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 594/595 places, 957/958 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 183448 steps, run timeout after 3002 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183448 steps, saw 80371 distinct states, run finished after 3003 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 957 rows 594 cols
[2023-03-12 06:35:42] [INFO ] Computed 110 place invariants in 16 ms
[2023-03-12 06:35:42] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:35:42] [INFO ] [Nat]Absence check using 31 positive place invariants in 6 ms returned sat
[2023-03-12 06:35:42] [INFO ] [Nat]Absence check using 31 positive and 79 generalized place invariants in 24 ms returned sat
[2023-03-12 06:35:44] [INFO ] After 1673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 06:35:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-12 06:35:51] [INFO ] After 6878ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 06:36:00] [INFO ] After 16423ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 370 ms.
[2023-03-12 06:36:01] [INFO ] After 18672ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 225 ms.
Support contains 29 out of 594 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 957/957 transitions.
Applied a total of 0 rules in 19 ms. Remains 594 /594 variables (removed 0) and now considering 957/957 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 594/594 places, 957/957 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 594/594 places, 957/957 transitions.
Applied a total of 0 rules in 18 ms. Remains 594 /594 variables (removed 0) and now considering 957/957 (removed 0) transitions.
[2023-03-12 06:36:01] [INFO ] Invariant cache hit.
[2023-03-12 06:36:01] [INFO ] Implicit Places using invariants in 535 ms returned [1, 19, 20, 22, 32, 50, 68, 107, 152, 165, 168, 169, 170, 188, 206, 288, 301, 302, 303, 304, 305, 323, 341, 421, 426, 437, 438, 439, 440, 441, 460, 462, 465, 483, 484, 485, 486, 498, 504, 516, 528, 534, 540, 546, 552, 558]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 556 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 548/594 places, 957/957 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 548 transition count 899
Reduce places removed 58 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 71 rules applied. Total rules applied 129 place count 490 transition count 886
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 142 place count 477 transition count 886
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 142 place count 477 transition count 863
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 47 rules applied. Total rules applied 189 place count 453 transition count 863
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 16 rules applied. Total rules applied 205 place count 444 transition count 856
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 213 place count 437 transition count 855
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 436 transition count 855
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 225 place count 425 transition count 844
Iterating global reduction 6 with 11 rules applied. Total rules applied 236 place count 425 transition count 844
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 241 place count 420 transition count 839
Iterating global reduction 6 with 5 rules applied. Total rules applied 246 place count 420 transition count 839
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 248 place count 420 transition count 837
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 314 place count 387 transition count 804
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 316 place count 385 transition count 802
Iterating global reduction 7 with 2 rules applied. Total rules applied 318 place count 385 transition count 802
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 320 place count 385 transition count 800
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 325 place count 385 transition count 795
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 332 place count 380 transition count 793
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 344 place count 380 transition count 781
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 356 place count 368 transition count 781
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 365 place count 368 transition count 781
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 366 place count 368 transition count 781
Applied a total of 366 rules in 159 ms. Remains 368 /548 variables (removed 180) and now considering 781/957 (removed 176) transitions.
// Phase 1: matrix 781 rows 368 cols
[2023-03-12 06:36:02] [INFO ] Computed 54 place invariants in 19 ms
[2023-03-12 06:36:02] [INFO ] Implicit Places using invariants in 360 ms returned [95, 106, 108, 111, 118, 119, 173, 191, 198, 201, 205, 210, 212, 264, 288, 291, 293, 294, 353, 357, 365, 367]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 362 ms to find 22 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 346/594 places, 781/957 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 341 transition count 776
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 341 transition count 776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 340 transition count 775
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 340 transition count 775
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 335 transition count 770
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 335 transition count 765
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 32 place count 330 transition count 765
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 330 transition count 763
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 328 transition count 763
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 328 transition count 763
Applied a total of 38 rules in 67 ms. Remains 328 /346 variables (removed 18) and now considering 763/781 (removed 18) transitions.
// Phase 1: matrix 763 rows 328 cols
[2023-03-12 06:36:02] [INFO ] Computed 32 place invariants in 9 ms
[2023-03-12 06:36:02] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-12 06:36:02] [INFO ] Invariant cache hit.
[2023-03-12 06:36:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 06:36:03] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 328/594 places, 763/957 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2496 ms. Remains : 328/594 places, 763/957 transitions.
Incomplete random walk after 10000 steps, including 176 resets, run finished after 237 ms. (steps per millisecond=42 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 166214 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166214 steps, saw 119381 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 06:36:07] [INFO ] Invariant cache hit.
[2023-03-12 06:36:07] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:36:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:07] [INFO ] [Nat]Absence check using 7 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-12 06:36:11] [INFO ] After 4423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 06:36:11] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 06:36:14] [INFO ] After 2939ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 06:36:16] [INFO ] After 4082ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 5603 ms.
[2023-03-12 06:36:21] [INFO ] After 14287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 495 ms.
Support contains 29 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 763/763 transitions.
Applied a total of 0 rules in 10 ms. Remains 328 /328 variables (removed 0) and now considering 763/763 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 328/328 places, 763/763 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 763/763 transitions.
Applied a total of 0 rules in 9 ms. Remains 328 /328 variables (removed 0) and now considering 763/763 (removed 0) transitions.
[2023-03-12 06:36:22] [INFO ] Invariant cache hit.
[2023-03-12 06:36:22] [INFO ] Implicit Places using invariants in 370 ms returned []
[2023-03-12 06:36:22] [INFO ] Invariant cache hit.
[2023-03-12 06:36:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-12 06:36:23] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1704 ms to find 0 implicit places.
[2023-03-12 06:36:23] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-12 06:36:23] [INFO ] Invariant cache hit.
[2023-03-12 06:36:24] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2305 ms. Remains : 328/328 places, 763/763 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 327 transition count 762
Applied a total of 2 rules in 25 ms. Remains 327 /328 variables (removed 1) and now considering 762/763 (removed 1) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 762 rows 327 cols
[2023-03-12 06:36:24] [INFO ] Computed 32 place invariants in 5 ms
[2023-03-12 06:36:24] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 06:36:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-12 06:36:24] [INFO ] [Nat]Absence check using 7 positive and 25 generalized place invariants in 27 ms returned sat
[2023-03-12 06:36:38] [INFO ] After 13547ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 06:36:40] [INFO ] Deduced a trap composed of 29 places in 344 ms of which 1 ms to minimize.
[2023-03-12 06:36:40] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2023-03-12 06:36:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 495 ms
[2023-03-12 06:36:40] [INFO ] After 15853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2727 ms.
[2023-03-12 06:36:43] [INFO ] After 18823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-12 06:36:43] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 13 ms.
[2023-03-12 06:36:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 328 places, 763 transitions and 3054 arcs took 7 ms.
[2023-03-12 06:36:43] [INFO ] Flatten gal took : 125 ms
Total runtime 118321 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/568/inv_0_ --invariant=/tmp/568/inv_1_ --invariant=/tmp/568/inv_2_ --invariant=/tmp/568/inv_3_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 158700 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16115248 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
mcc2023

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-03a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-03a, 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 r009-oct2-167813597300046"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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