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

About the Execution of Marcie+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
9658.184 3600000.00 3666999.00 194.70 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.r010-oct2-167813598500030.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 marciexred
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 r010-oct2-167813598500030
=====================================================================

--------------------
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 1678655407299

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 21:10:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 21:10:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 21:10:10] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2023-03-12 21:10:10] [INFO ] Transformed 626 places.
[2023-03-12 21:10:10] [INFO ] Transformed 1008 transitions.
[2023-03-12 21:10:10] [INFO ] Found NUPN structural information;
[2023-03-12 21:10:10] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 12 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 122 resets, run finished after 417 ms. (steps per millisecond=23 ) 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 29 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :1
FORMULA ASLink-PT-02a-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 998 rows 626 cols
[2023-03-12 21:10:11] [INFO ] Computed 118 place invariants in 104 ms
[2023-03-12 21:10:11] [INFO ] After 454ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 21:10:12] [INFO ] [Nat]Absence check using 28 positive place invariants in 13 ms returned sat
[2023-03-12 21:10:12] [INFO ] [Nat]Absence check using 28 positive and 90 generalized place invariants in 32 ms returned sat
[2023-03-12 21:10:13] [INFO ] After 1661ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-12 21:10:14] [INFO ] After 2718ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 698 ms.
[2023-03-12 21:10:15] [INFO ] After 3692ms 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 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 17 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 614 transition count 951
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 106 place count 567 transition count 951
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 106 place count 567 transition count 905
Deduced a syphon composed of 46 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 109 rules applied. Total rules applied 215 place count 504 transition count 905
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 216 place count 504 transition count 904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 503 transition count 904
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 222 place count 498 transition count 881
Ensure Unique test removed 1 places
Iterating global reduction 4 with 6 rules applied. Total rules applied 228 place count 497 transition count 881
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 4 with 3 rules applied. Total rules applied 231 place count 497 transition count 878
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 496 transition count 878
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 232 place count 496 transition count 876
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 6 with 5 rules applied. Total rules applied 237 place count 493 transition count 876
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 238 place count 492 transition count 868
Iterating global reduction 6 with 1 rules applied. Total rules applied 239 place count 492 transition count 868
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 491 transition count 860
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 491 transition count 860
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 242 place count 490 transition count 852
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 490 transition count 852
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 244 place count 489 transition count 844
Iterating global reduction 6 with 1 rules applied. Total rules applied 245 place count 489 transition count 844
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 488 transition count 836
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 488 transition count 836
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 248 place count 487 transition count 828
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 487 transition count 828
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 486 transition count 820
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 486 transition count 820
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 252 place count 485 transition count 812
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 485 transition count 812
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 254 place count 484 transition count 804
Iterating global reduction 6 with 1 rules applied. Total rules applied 255 place count 484 transition count 804
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 256 place count 483 transition count 796
Iterating global reduction 6 with 1 rules applied. Total rules applied 257 place count 483 transition count 796
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 258 place count 482 transition count 788
Iterating global reduction 6 with 1 rules applied. Total rules applied 259 place count 482 transition count 788
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 260 place count 481 transition count 780
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 481 transition count 780
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 262 place count 480 transition count 772
Iterating global reduction 6 with 1 rules applied. Total rules applied 263 place count 480 transition count 772
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 264 place count 479 transition count 764
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 479 transition count 764
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 266 place count 478 transition count 756
Iterating global reduction 6 with 1 rules applied. Total rules applied 267 place count 478 transition count 756
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 477 transition count 748
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 477 transition count 748
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 6 with 22 rules applied. Total rules applied 291 place count 466 transition count 737
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 466 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 293 place count 465 transition count 736
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 294 place count 465 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 295 place count 464 transition count 735
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 298 place count 464 transition count 735
Applied a total of 298 rules in 489 ms. Remains 464 /626 variables (removed 162) and now considering 735/998 (removed 263) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 ms. Remains : 464/626 places, 735/998 transitions.
Incomplete random walk after 10000 steps, including 143 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 261633 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 261633 steps, saw 108820 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 735 rows 464 cols
[2023-03-12 21:10:19] [INFO ] Computed 87 place invariants in 23 ms
[2023-03-12 21:10:19] [INFO ] After 116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 21:10:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-12 21:10:19] [INFO ] [Nat]Absence check using 23 positive and 64 generalized place invariants in 18 ms returned sat
[2023-03-12 21:10:20] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 21:10:20] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 21:10:20] [INFO ] After 389ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 21:10:21] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 1 ms to minimize.
[2023-03-12 21:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 294 ms
[2023-03-12 21:10:21] [INFO ] After 1162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 421 ms.
[2023-03-12 21:10:22] [INFO ] After 2330ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 213 ms.
Support contains 17 out of 464 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 735/735 transitions.
Applied a total of 0 rules in 20 ms. Remains 464 /464 variables (removed 0) and now considering 735/735 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 464/464 places, 735/735 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 464/464 places, 735/735 transitions.
Applied a total of 0 rules in 18 ms. Remains 464 /464 variables (removed 0) and now considering 735/735 (removed 0) transitions.
[2023-03-12 21:10:22] [INFO ] Invariant cache hit.
[2023-03-12 21:10:22] [INFO ] Implicit Places using invariants in 362 ms returned [1, 19, 20, 22, 32, 50, 68, 104, 151, 164, 169, 170, 171, 189, 207, 289, 294, 305, 306, 307, 308, 309, 329, 332, 350, 351, 352, 353, 365, 371, 383, 395, 401, 407, 413, 419, 425, 461]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 365 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 426/464 places, 735/735 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 426 transition count 691
Reduce places removed 44 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 382 transition count 688
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 379 transition count 688
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 94 place count 379 transition count 671
Deduced a syphon composed of 17 places in 2 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 129 place count 361 transition count 671
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 146 place count 354 transition count 661
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 156 place count 344 transition count 661
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 169 place count 331 transition count 648
Iterating global reduction 5 with 13 rules applied. Total rules applied 182 place count 331 transition count 648
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 185 place count 331 transition count 645
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 185 place count 331 transition count 644
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 330 transition count 644
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 190 place count 327 transition count 641
Iterating global reduction 6 with 3 rules applied. Total rules applied 193 place count 327 transition count 641
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 196 place count 324 transition count 638
Iterating global reduction 6 with 3 rules applied. Total rules applied 199 place count 324 transition count 638
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 249 place count 299 transition count 613
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 250 place count 298 transition count 612
Iterating global reduction 6 with 1 rules applied. Total rules applied 251 place count 298 transition count 612
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 252 place count 298 transition count 611
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 254 place count 298 transition count 609
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 257 place count 296 transition count 608
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 8 with 9 rules applied. Total rules applied 266 place count 296 transition count 599
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 276 place count 286 transition count 599
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 282 place count 286 transition count 599
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 283 place count 286 transition count 599
Applied a total of 283 rules in 147 ms. Remains 286 /426 variables (removed 140) and now considering 599/735 (removed 136) transitions.
// Phase 1: matrix 599 rows 286 cols
[2023-03-12 21:10:22] [INFO ] Computed 40 place invariants in 9 ms
[2023-03-12 21:10:23] [INFO ] Implicit Places using invariants in 222 ms returned [103, 105, 108, 115, 116, 172, 190, 205, 206]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 227 ms to find 9 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 277/464 places, 599/735 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 277 transition count 598
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 276 transition count 598
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 275 transition count 597
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 275 transition count 597
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 272 transition count 594
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 272 transition count 591
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 269 transition count 591
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 269 transition count 590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 268 transition count 590
Applied a total of 18 rules in 46 ms. Remains 268 /277 variables (removed 9) and now considering 590/599 (removed 9) transitions.
// Phase 1: matrix 590 rows 268 cols
[2023-03-12 21:10:23] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-12 21:10:23] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-12 21:10:23] [INFO ] Invariant cache hit.
[2023-03-12 21:10:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 21:10:23] [INFO ] Implicit Places using invariants and state equation in 731 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 268/464 places, 590/735 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1690 ms. Remains : 268/464 places, 590/735 transitions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 14908 steps, run visited all 3 properties in 75 ms. (steps per millisecond=198 )
Probabilistic random walk after 14908 steps, saw 10158 distinct states, run finished after 75 ms. (steps per millisecond=198 ) properties seen :3
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
All properties solved without resorting to model-checking.
Total runtime 14169 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_02a
(NrP: 626 NrTr: 1008 NrArc: 3820)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.055sec

net check time: 0m 0.000sec

init dd package: 0m 2.947sec


before gc: list nodes free: 389344

after gc: idd nodes used:109504, unused:63890496; list nodes free:265856915

before gc: list nodes free: 86775

after gc: idd nodes used:85651, unused:63914349; list nodes free:268044049

before gc: list nodes free: 557691

after gc: idd nodes used:162682, unused:63837318; list nodes free:269828525
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6492292 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102208 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.004sec

11538 13508 14098 14149 15415 25503 29504 26595 22746 25121 29413 28688 25789 29004 28878 31845 31061 29213 29116 33358 31475 29203 29129 33521 31815 27755 28189 28936 31910 30820 29103 29007 33374 31486 29262 29142 33539 31815 29234 28210 28248 31892 30827 29081 28993 33257 31349 29265 29168 33531 31807 28746 29688 28725 32150 31014 28435 29232 33467 31580 29351 29396 33751 32085 29027 29403 28583 32165 28582 28491 29133 33504 31470 29359 29335 33983 32240 29234 29645 28788 32342 26251 30200 29341 34656 37842 40332 50321 51180 56684 104066 77426 81865 84060 85331 85152 84645 88006 90473 90067 96133 126747 140577 154901 148686 116971 111632 118212 118571 119850 123110 126502 191970

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="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is 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 r010-oct2-167813598500030"
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 ;