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

About the Execution of Marcie+red for ASLink-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9571.523 3600000.00 3677629.00 127.70 ?T?T?TFTT?FFTFFT 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-167813598600150.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-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:05 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.4K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 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 1.3M 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-09b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-09b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678672629002

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-09b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 01:57:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 01:57:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 01:57:12] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2023-03-13 01:57:12] [INFO ] Transformed 4014 places.
[2023-03-13 01:57:12] [INFO ] Transformed 4932 transitions.
[2023-03-13 01:57:12] [INFO ] Found NUPN structural information;
[2023-03-13 01:57:12] [INFO ] Parsed PT model containing 4014 places and 4932 transitions and 14960 arcs in 618 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-09b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 11 resets, run finished after 675 ms. (steps per millisecond=14 ) properties (out of 15) seen :4
FORMULA ASLink-PT-09b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 4932 rows 4014 cols
[2023-03-13 01:57:13] [INFO ] Computed 394 place invariants in 166 ms
[2023-03-13 01:57:15] [INFO ] After 1761ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 01:57:17] [INFO ] [Nat]Absence check using 93 positive place invariants in 111 ms returned sat
[2023-03-13 01:57:17] [INFO ] [Nat]Absence check using 93 positive and 301 generalized place invariants in 297 ms returned sat
[2023-03-13 01:57:40] [INFO ] After 21880ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-13 01:57:40] [INFO ] After 21911ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 01:57:40] [INFO ] After 25104ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA ASLink-PT-09b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 75 out of 4014 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4014/4014 places, 4932/4932 transitions.
Drop transitions removed 892 transitions
Trivial Post-agglo rules discarded 892 transitions
Performed 892 trivial Post agglomeration. Transition count delta: 892
Iterating post reduction 0 with 892 rules applied. Total rules applied 892 place count 4014 transition count 4040
Reduce places removed 892 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 932 rules applied. Total rules applied 1824 place count 3122 transition count 4000
Reduce places removed 10 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 29 rules applied. Total rules applied 1853 place count 3112 transition count 3981
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 1872 place count 3093 transition count 3981
Performed 897 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 897 Pre rules applied. Total rules applied 1872 place count 3093 transition count 3084
Deduced a syphon composed of 897 places in 24 ms
Ensure Unique test removed 83 places
Reduce places removed 980 places and 0 transitions.
Iterating global reduction 4 with 1877 rules applied. Total rules applied 3749 place count 2113 transition count 3084
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 4 with 69 rules applied. Total rules applied 3818 place count 2098 transition count 3030
Reduce places removed 54 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 61 rules applied. Total rules applied 3879 place count 2044 transition count 3023
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 3886 place count 2037 transition count 3023
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 27 Pre rules applied. Total rules applied 3886 place count 2037 transition count 2996
Deduced a syphon composed of 27 places in 9 ms
Ensure Unique test removed 20 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 74 rules applied. Total rules applied 3960 place count 1990 transition count 2996
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 20 Pre rules applied. Total rules applied 3960 place count 1990 transition count 2976
Deduced a syphon composed of 20 places in 18 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 4000 place count 1970 transition count 2976
Discarding 126 places :
Symmetric choice reduction at 7 with 126 rule applications. Total rules 4126 place count 1844 transition count 2850
Iterating global reduction 7 with 126 rules applied. Total rules applied 4252 place count 1844 transition count 2850
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 38 Pre rules applied. Total rules applied 4252 place count 1844 transition count 2812
Deduced a syphon composed of 38 places in 32 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 7 with 76 rules applied. Total rules applied 4328 place count 1806 transition count 2812
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4337 place count 1797 transition count 2755
Iterating global reduction 7 with 9 rules applied. Total rules applied 4346 place count 1797 transition count 2755
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 4346 place count 1797 transition count 2747
Deduced a syphon composed of 8 places in 19 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 4362 place count 1789 transition count 2747
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4363 place count 1788 transition count 2739
Iterating global reduction 7 with 1 rules applied. Total rules applied 4364 place count 1788 transition count 2739
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4365 place count 1787 transition count 2731
Iterating global reduction 7 with 1 rules applied. Total rules applied 4366 place count 1787 transition count 2731
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4367 place count 1786 transition count 2723
Iterating global reduction 7 with 1 rules applied. Total rules applied 4368 place count 1786 transition count 2723
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4369 place count 1785 transition count 2715
Iterating global reduction 7 with 1 rules applied. Total rules applied 4370 place count 1785 transition count 2715
Performed 241 Post agglomeration using F-continuation condition.Transition count delta: 241
Deduced a syphon composed of 241 places in 8 ms
Ensure Unique test removed 7 places
Reduce places removed 248 places and 0 transitions.
Iterating global reduction 7 with 489 rules applied. Total rules applied 4859 place count 1537 transition count 2474
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4860 place count 1536 transition count 2473
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 4862 place count 1535 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 4863 place count 1534 transition count 2472
Iterating global reduction 7 with 1 rules applied. Total rules applied 4864 place count 1534 transition count 2472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 7 with 2 rules applied. Total rules applied 4866 place count 1534 transition count 2470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 4867 place count 1533 transition count 2470
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 4871 place count 1531 transition count 2482
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 4872 place count 1531 transition count 2481
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 4874 place count 1530 transition count 2480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 4875 place count 1529 transition count 2480
Free-agglomeration rule applied 14 times.
Iterating global reduction 11 with 14 rules applied. Total rules applied 4889 place count 1529 transition count 2466
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 11 with 14 rules applied. Total rules applied 4903 place count 1515 transition count 2466
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 12 with 10 rules applied. Total rules applied 4913 place count 1515 transition count 2456
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 4923 place count 1505 transition count 2456
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 4924 place count 1504 transition count 2455
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 13 with 20 rules applied. Total rules applied 4944 place count 1490 transition count 2449
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 4950 place count 1484 transition count 2449
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 20 Pre rules applied. Total rules applied 4950 place count 1484 transition count 2429
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 15 with 40 rules applied. Total rules applied 4990 place count 1464 transition count 2429
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 15 with 7 rules applied. Total rules applied 4997 place count 1457 transition count 2429
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 5 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 5027 place count 1442 transition count 2414
Discarding 6 places :
Symmetric choice reduction at 16 with 6 rule applications. Total rules 5033 place count 1436 transition count 2408
Iterating global reduction 16 with 6 rules applied. Total rules applied 5039 place count 1436 transition count 2408
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 5040 place count 1435 transition count 2407
Iterating global reduction 16 with 1 rules applied. Total rules applied 5041 place count 1435 transition count 2407
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 5042 place count 1435 transition count 2406
Free-agglomeration rule applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 5048 place count 1435 transition count 2400
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 17 with 6 rules applied. Total rules applied 5054 place count 1429 transition count 2400
Applied a total of 5054 rules in 2418 ms. Remains 1429 /4014 variables (removed 2585) and now considering 2400/4932 (removed 2532) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2419 ms. Remains : 1429/4014 places, 2400/4932 transitions.
Incomplete random walk after 10000 steps, including 74 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 10) seen :4
FORMULA ASLink-PT-09b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2400 rows 1429 cols
[2023-03-13 01:57:44] [INFO ] Computed 246 place invariants in 42 ms
[2023-03-13 01:57:44] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 01:57:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 119 ms returned sat
[2023-03-13 01:57:44] [INFO ] [Nat]Absence check using 55 positive and 191 generalized place invariants in 113 ms returned sat
[2023-03-13 01:58:02] [INFO ] After 16902ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 01:58:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:58:06] [INFO ] After 4460ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 01:58:07] [INFO ] Deduced a trap composed of 47 places in 407 ms of which 11 ms to minimize.
[2023-03-13 01:58:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 651 ms
[2023-03-13 01:58:09] [INFO ] After 7370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 01:58:09] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 338 ms.
Support contains 53 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 2400/2400 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 1429 transition count 2393
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 1421 transition count 2393
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 15 place count 1421 transition count 2379
Deduced a syphon composed of 14 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 46 place count 1404 transition count 2379
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 1403 transition count 2379
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 47 place count 1403 transition count 2376
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 53 place count 1400 transition count 2376
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 1399 transition count 2375
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 1399 transition count 2375
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 71 place count 1391 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 1390 transition count 2366
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 1390 transition count 2366
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 74 place count 1390 transition count 2365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 1389 transition count 2365
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 1389 transition count 2365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 1387 transition count 2363
Applied a total of 78 rules in 397 ms. Remains 1387 /1429 variables (removed 42) and now considering 2363/2400 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 1387/1429 places, 2363/2400 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 127886 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 127886 steps, saw 32137 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2363 rows 1387 cols
[2023-03-13 01:58:13] [INFO ] Computed 241 place invariants in 23 ms
[2023-03-13 01:58:14] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 01:58:14] [INFO ] [Nat]Absence check using 59 positive place invariants in 27 ms returned sat
[2023-03-13 01:58:14] [INFO ] [Nat]Absence check using 59 positive and 182 generalized place invariants in 69 ms returned sat
[2023-03-13 01:58:35] [INFO ] After 20163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:58:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:58:38] [INFO ] After 3939ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 01:58:39] [INFO ] After 4115ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 0 ms.
[2023-03-13 01:58:39] [INFO ] After 25084ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 153 ms.
Support contains 53 out of 1387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 50 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1387/1387 places, 2363/2363 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1387/1387 places, 2363/2363 transitions.
Applied a total of 0 rules in 50 ms. Remains 1387 /1387 variables (removed 0) and now considering 2363/2363 (removed 0) transitions.
[2023-03-13 01:58:39] [INFO ] Invariant cache hit.
[2023-03-13 01:58:41] [INFO ] Implicit Places using invariants in 1631 ms returned [1, 18, 19, 49, 67, 119, 143, 147, 160, 161, 164, 182, 200, 253, 266, 281, 286, 300, 301, 303, 320, 338, 408, 413, 414, 425, 426, 466, 485, 519, 543, 544, 549, 550, 561, 562, 564, 582, 600, 640, 675, 677, 681, 682, 693, 694, 696, 713, 732, 772, 786, 814, 829, 830, 832, 849, 867, 902, 929, 946, 950, 951, 962, 963, 965, 982, 1000, 1070, 1074, 1075, 1086, 1087, 1089, 1106, 1124, 1195, 1199, 1200, 1203, 1214, 1216, 1217, 1248, 1250, 1254, 1272, 1273, 1274, 1275, 1287, 1293, 1299, 1305, 1311, 1317, 1323, 1329, 1335, 1342, 1348, 1386]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 1649 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1286/1387 places, 2363/2363 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1286 transition count 2229
Reduce places removed 134 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 149 rules applied. Total rules applied 283 place count 1152 transition count 2214
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 296 place count 1139 transition count 2214
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 296 place count 1139 transition count 2172
Deduced a syphon composed of 42 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 85 rules applied. Total rules applied 381 place count 1096 transition count 2172
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 393 place count 1084 transition count 2160
Iterating global reduction 3 with 12 rules applied. Total rules applied 405 place count 1084 transition count 2160
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 409 place count 1080 transition count 2153
Iterating global reduction 3 with 4 rules applied. Total rules applied 413 place count 1080 transition count 2153
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 415 place count 1078 transition count 2151
Iterating global reduction 3 with 2 rules applied. Total rules applied 417 place count 1078 transition count 2151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 418 place count 1078 transition count 2150
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 419 place count 1077 transition count 2148
Iterating global reduction 4 with 1 rules applied. Total rules applied 420 place count 1077 transition count 2148
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 27 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 550 place count 1012 transition count 2083
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 557 place count 1005 transition count 2075
Iterating global reduction 4 with 7 rules applied. Total rules applied 564 place count 1005 transition count 2075
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 569 place count 1005 transition count 2070
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 573 place count 1003 transition count 2071
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 580 place count 1003 transition count 2064
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 582 place count 1003 transition count 2062
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 584 place count 1001 transition count 2062
Free-agglomeration rule (complex) applied 25 times.
Iterating global reduction 6 with 25 rules applied. Total rules applied 609 place count 1001 transition count 2037
Ensure Unique test removed 5 places
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 639 place count 971 transition count 2037
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 642 place count 968 transition count 2034
Iterating global reduction 7 with 3 rules applied. Total rules applied 645 place count 968 transition count 2034
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 648 place count 968 transition count 2031
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 649 place count 968 transition count 2030
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 673 place count 968 transition count 2030
Applied a total of 673 rules in 610 ms. Remains 968 /1286 variables (removed 318) and now considering 2030/2363 (removed 333) transitions.
// Phase 1: matrix 2030 rows 968 cols
[2023-03-13 01:58:41] [INFO ] Computed 134 place invariants in 29 ms
[2023-03-13 01:58:42] [INFO ] Implicit Places using invariants in 790 ms returned [74, 107, 110, 181, 211, 213, 226, 299, 305, 308, 310, 317, 318, 412, 427, 428, 483, 502, 508, 511, 521, 522, 603, 606, 608, 611, 618, 619, 674, 693, 704, 716, 717, 770, 787, 793, 796, 798, 803, 804, 857, 874, 881, 884, 886]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 808 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 923/1387 places, 2030/2363 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 910 transition count 2017
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 910 transition count 2017
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 906 transition count 2013
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 906 transition count 2013
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 4 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 62 place count 892 transition count 1999
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 63 place count 892 transition count 1998
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 78 place count 892 transition count 1983
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 93 place count 877 transition count 1983
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 877 transition count 1978
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 103 place count 872 transition count 1978
Applied a total of 103 rules in 228 ms. Remains 872 /923 variables (removed 51) and now considering 1978/2030 (removed 52) transitions.
// Phase 1: matrix 1978 rows 872 cols
[2023-03-13 01:58:42] [INFO ] Computed 89 place invariants in 44 ms
[2023-03-13 01:58:43] [INFO ] Implicit Places using invariants in 738 ms returned []
[2023-03-13 01:58:43] [INFO ] Invariant cache hit.
[2023-03-13 01:58:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:58:45] [INFO ] Implicit Places using invariants and state equation in 2388 ms returned []
Implicit Place search using SMT with State Equation took 3142 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 872/1387 places, 1978/2363 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6489 ms. Remains : 872/1387 places, 1978/2363 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 137089 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{5=1}
Probabilistic random walk after 137089 steps, saw 59978 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 5 properties.
[2023-03-13 01:58:49] [INFO ] Invariant cache hit.
[2023-03-13 01:58:49] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 01:58:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 6 ms returned sat
[2023-03-13 01:58:49] [INFO ] [Nat]Absence check using 19 positive and 70 generalized place invariants in 56 ms returned sat
[2023-03-13 01:59:01] [INFO ] After 11489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:59:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:59:01] [INFO ] After 441ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 01:59:02] [INFO ] Deduced a trap composed of 60 places in 343 ms of which 4 ms to minimize.
[2023-03-13 01:59:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2023-03-13 01:59:03] [INFO ] After 1705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9578 ms.
[2023-03-13 01:59:12] [INFO ] After 23108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 143 ms.
Support contains 52 out of 872 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 872/872 places, 1978/1978 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 872 transition count 1977
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 871 transition count 1977
Applied a total of 2 rules in 37 ms. Remains 871 /872 variables (removed 1) and now considering 1977/1978 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 871/872 places, 1977/1978 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 5) seen :1
FORMULA ASLink-PT-09b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1977 rows 871 cols
[2023-03-13 01:59:13] [INFO ] Computed 89 place invariants in 14 ms
[2023-03-13 01:59:13] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:59:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 71 ms returned sat
[2023-03-13 01:59:13] [INFO ] [Nat]Absence check using 21 positive and 68 generalized place invariants in 30 ms returned sat
[2023-03-13 01:59:24] [INFO ] After 10863ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 01:59:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:59:31] [INFO ] After 6467ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 01:59:38] [INFO ] After 13847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 01:59:38] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 236 ms.
Support contains 51 out of 871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 37 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 871/871 places, 1977/1977 transitions.
Incomplete random walk after 10000 steps, including 120 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 140225 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140225 steps, saw 61683 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 01:59:41] [INFO ] Invariant cache hit.
[2023-03-13 01:59:42] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 01:59:42] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned sat
[2023-03-13 01:59:42] [INFO ] [Nat]Absence check using 21 positive and 68 generalized place invariants in 34 ms returned sat
[2023-03-13 01:59:44] [INFO ] After 2279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 01:59:44] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 01:59:55] [INFO ] After 10481ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 02:00:05] [INFO ] After 20661ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 251 ms.
[2023-03-13 02:00:05] [INFO ] After 23489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 522 ms.
Support contains 51 out of 871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 32 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 871/871 places, 1977/1977 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 871/871 places, 1977/1977 transitions.
Applied a total of 0 rules in 32 ms. Remains 871 /871 variables (removed 0) and now considering 1977/1977 (removed 0) transitions.
[2023-03-13 02:00:06] [INFO ] Invariant cache hit.
[2023-03-13 02:00:07] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-13 02:00:07] [INFO ] Invariant cache hit.
[2023-03-13 02:00:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 02:00:09] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3515 ms to find 0 implicit places.
[2023-03-13 02:00:09] [INFO ] Redundant transitions in 190 ms returned []
[2023-03-13 02:00:09] [INFO ] Invariant cache hit.
[2023-03-13 02:00:10] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4510 ms. Remains : 871/871 places, 1977/1977 transitions.
Graph (complete) has 4753 edges and 871 vertex of which 870 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 870 transition count 1974
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 867 transition count 1974
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 866 transition count 1974
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 865 transition count 1973
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 865 transition count 1972
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 864 transition count 1972
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 864 transition count 1971
Applied a total of 13 rules in 143 ms. Remains 864 /871 variables (removed 7) and now considering 1971/1977 (removed 6) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1971 rows 864 cols
[2023-03-13 02:00:10] [INFO ] Computed 87 place invariants in 15 ms
[2023-03-13 02:00:11] [INFO ] After 189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 02:00:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-13 02:00:11] [INFO ] [Nat]Absence check using 20 positive and 67 generalized place invariants in 35 ms returned sat
[2023-03-13 02:00:28] [INFO ] After 16717ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 02:00:29] [INFO ] Deduced a trap composed of 11 places in 235 ms of which 1 ms to minimize.
[2023-03-13 02:00:38] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 9299 ms
[2023-03-13 02:00:38] [INFO ] After 27572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 326 ms.
[2023-03-13 02:00:39] [INFO ] After 28237ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-13 02:00:39] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-13 02:00:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 871 places, 1977 transitions and 7874 arcs took 19 ms.
[2023-03-13 02:00:39] [INFO ] Flatten gal took : 190 ms
Total runtime 208063 ms.
There are residual formulas that ITS could not solve within timeout
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_09b
(NrP: 871 NrTr: 1977 NrArc: 7874)

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

net check time: 0m 0.002sec

init dd package: 0m 3.015sec


before gc: list nodes free: 1090722

after gc: idd nodes used:2702, unused:63997298; list nodes free:264210260
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6580188 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094468 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.015sec

1247 1275 1337 1375 1420 1357 1476 1471 1485 1629 1564 1719 1577 1632 1841 1687 1868 1757 1994 1779 1797 2110 1911 2154 1922 2271 1985

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-09b"
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-09b, 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-167813598600150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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