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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16166.695 3600000.00 13916315.00 79.40 F?????T?TT?F?FTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597400078.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-05a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K 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.5K 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 17K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 13:05 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 516K 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-05a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-05a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678606920726

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-05a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 07:42:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 07:42:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 07:42:03] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-12 07:42:03] [INFO ] Transformed 1211 places.
[2023-03-12 07:42:03] [INFO ] Transformed 1827 transitions.
[2023-03-12 07:42:03] [INFO ] Found NUPN structural information;
[2023-03-12 07:42:03] [INFO ] Parsed PT model containing 1211 places and 1827 transitions and 6877 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
FORMULA ASLink-PT-05a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 59 resets, run finished after 567 ms. (steps per millisecond=17 ) properties (out of 15) seen :4
FORMULA ASLink-PT-05a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 10 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :1
FORMULA ASLink-PT-05a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 1808 rows 1211 cols
[2023-03-12 07:42:05] [INFO ] Computed 232 place invariants in 100 ms
[2023-03-12 07:42:06] [INFO ] After 760ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 07:42:06] [INFO ] [Nat]Absence check using 56 positive place invariants in 19 ms returned sat
[2023-03-12 07:42:06] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 47 ms returned sat
[2023-03-12 07:42:31] [INFO ] After 24377ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 07:42:31] [INFO ] After 24395ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 07:42:31] [INFO ] After 25053ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA ASLink-PT-05a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 149 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 19 places
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 1182 transition count 1738
Reduce places removed 70 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 80 rules applied. Total rules applied 179 place count 1112 transition count 1728
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 189 place count 1102 transition count 1728
Performed 89 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 89 Pre rules applied. Total rules applied 189 place count 1102 transition count 1639
Deduced a syphon composed of 89 places in 5 ms
Ensure Unique test removed 26 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 393 place count 987 transition count 1639
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 987 transition count 1638
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 395 place count 986 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 402 place count 979 transition count 1603
Ensure Unique test removed 1 places
Iterating global reduction 5 with 8 rules applied. Total rules applied 410 place count 978 transition count 1603
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 415 place count 977 transition count 1599
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 417 place count 975 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 418 place count 974 transition count 1591
Iterating global reduction 7 with 1 rules applied. Total rules applied 419 place count 974 transition count 1591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 420 place count 973 transition count 1583
Iterating global reduction 7 with 1 rules applied. Total rules applied 421 place count 973 transition count 1583
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 475 place count 946 transition count 1556
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 477 place count 946 transition count 1554
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 479 place count 944 transition count 1554
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 487 place count 944 transition count 1546
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 495 place count 936 transition count 1546
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 499 place count 936 transition count 1546
Applied a total of 499 rules in 509 ms. Remains 936 /1211 variables (removed 275) and now considering 1546/1808 (removed 262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 936/1211 places, 1546/1808 transitions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 140960 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{0=1}
Probabilistic random walk after 140960 steps, saw 49722 distinct states, run finished after 3002 ms. (steps per millisecond=46 ) properties seen :1
FORMULA ASLink-PT-05a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 8 properties.
// Phase 1: matrix 1546 rows 936 cols
[2023-03-12 07:42:35] [INFO ] Computed 175 place invariants in 25 ms
[2023-03-12 07:42:35] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 07:42:36] [INFO ] [Nat]Absence check using 47 positive place invariants in 20 ms returned sat
[2023-03-12 07:42:36] [INFO ] [Nat]Absence check using 47 positive and 128 generalized place invariants in 72 ms returned sat
[2023-03-12 07:42:59] [INFO ] After 23522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 07:42:59] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-12 07:43:00] [INFO ] After 863ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 07:43:00] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 07:43:00] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 1713 ms.
Support contains 147 out of 936 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 936/936 places, 1546/1546 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 936 transition count 1545
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 934 transition count 1545
Applied a total of 3 rules in 64 ms. Remains 934 /936 variables (removed 2) and now considering 1545/1546 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 934/936 places, 1545/1546 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 146856 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146856 steps, saw 51596 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1545 rows 934 cols
[2023-03-12 07:43:06] [INFO ] Computed 174 place invariants in 13 ms
[2023-03-12 07:43:06] [INFO ] After 306ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 07:43:06] [INFO ] [Nat]Absence check using 46 positive place invariants in 21 ms returned sat
[2023-03-12 07:43:06] [INFO ] [Nat]Absence check using 46 positive and 128 generalized place invariants in 58 ms returned sat
[2023-03-12 07:43:31] [INFO ] After 24376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 07:43:31] [INFO ] State equation strengthened by 24 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 07:43:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 07:43:31] [INFO ] After 25046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 374 ms.
Support contains 147 out of 934 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1545/1545 transitions.
Applied a total of 0 rules in 28 ms. Remains 934 /934 variables (removed 0) and now considering 1545/1545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 934/934 places, 1545/1545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 934/934 places, 1545/1545 transitions.
Applied a total of 0 rules in 93 ms. Remains 934 /934 variables (removed 0) and now considering 1545/1545 (removed 0) transitions.
[2023-03-12 07:43:32] [INFO ] Invariant cache hit.
[2023-03-12 07:43:32] [INFO ] Implicit Places using invariants in 639 ms returned [1, 19, 33, 51, 69, 107, 122, 136, 159, 172, 174, 175, 176, 194, 251, 268, 281, 305, 319, 320, 321, 322, 342, 360, 397, 420, 455, 471, 472, 474, 492, 510, 548, 565, 586, 612, 613, 614, 615, 616, 634, 652, 690, 707, 718, 729, 745, 751, 762, 766, 767, 799, 804, 822, 823, 825, 838, 844, 850, 856, 862, 868, 874, 880, 886, 898]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 651 ms to find 66 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 868/934 places, 1545/1545 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 868 transition count 1499
Reduce places removed 46 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 60 rules applied. Total rules applied 106 place count 822 transition count 1485
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 120 place count 808 transition count 1485
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 120 place count 808 transition count 1471
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 148 place count 794 transition count 1471
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 7 rules applied. Total rules applied 155 place count 790 transition count 1468
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 159 place count 787 transition count 1467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 160 place count 786 transition count 1467
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 169 place count 777 transition count 1458
Ensure Unique test removed 1 places
Iterating global reduction 6 with 10 rules applied. Total rules applied 179 place count 776 transition count 1458
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 183 place count 772 transition count 1454
Iterating global reduction 6 with 4 rules applied. Total rules applied 187 place count 772 transition count 1454
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 771 transition count 1453
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 771 transition count 1453
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 770 transition count 1452
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 770 transition count 1452
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 2 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 245 place count 743 transition count 1425
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 742 transition count 1424
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 742 transition count 1424
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 248 place count 742 transition count 1423
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 249 place count 742 transition count 1422
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 250 place count 741 transition count 1422
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 8 with 26 rules applied. Total rules applied 276 place count 741 transition count 1396
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 8 with 26 rules applied. Total rules applied 302 place count 715 transition count 1396
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 312 place count 715 transition count 1396
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 316 place count 715 transition count 1396
Applied a total of 316 rules in 346 ms. Remains 715 /868 variables (removed 153) and now considering 1396/1545 (removed 149) transitions.
// Phase 1: matrix 1396 rows 715 cols
[2023-03-12 07:43:33] [INFO ] Computed 103 place invariants in 10 ms
[2023-03-12 07:43:33] [INFO ] Implicit Places using invariants in 392 ms returned [127, 134, 233, 252, 254, 374, 440, 471, 474, 601, 700, 702, 711, 714]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 397 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 701/934 places, 1396/1545 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 698 transition count 1393
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 698 transition count 1393
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 696 transition count 1391
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 696 transition count 1390
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 696 transition count 1388
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 694 transition count 1388
Applied a total of 15 rules in 107 ms. Remains 694 /701 variables (removed 7) and now considering 1388/1396 (removed 8) transitions.
// Phase 1: matrix 1388 rows 694 cols
[2023-03-12 07:43:33] [INFO ] Computed 89 place invariants in 10 ms
[2023-03-12 07:43:33] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-12 07:43:33] [INFO ] Invariant cache hit.
[2023-03-12 07:43:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 07:43:35] [INFO ] Implicit Places using invariants and state equation in 1825 ms returned []
Implicit Place search using SMT with State Equation took 2132 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 694/934 places, 1388/1545 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3726 ms. Remains : 694/934 places, 1388/1545 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 186680 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186680 steps, saw 67983 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-12 07:43:39] [INFO ] Invariant cache hit.
[2023-03-12 07:43:39] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 07:43:39] [INFO ] [Nat]Absence check using 27 positive place invariants in 7 ms returned sat
[2023-03-12 07:43:40] [INFO ] [Nat]Absence check using 27 positive and 62 generalized place invariants in 75 ms returned sat
[2023-03-12 07:43:57] [INFO ] After 17564ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-12 07:43:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 07:44:04] [INFO ] After 6929ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-12 07:44:04] [INFO ] After 6935ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 07:44:04] [INFO ] After 25029ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 832 ms.
Support contains 147 out of 694 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1388/1388 transitions.
Applied a total of 0 rules in 18 ms. Remains 694 /694 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 694/694 places, 1388/1388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 694/694 places, 1388/1388 transitions.
Applied a total of 0 rules in 16 ms. Remains 694 /694 variables (removed 0) and now considering 1388/1388 (removed 0) transitions.
[2023-03-12 07:44:05] [INFO ] Invariant cache hit.
[2023-03-12 07:44:05] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-12 07:44:05] [INFO ] Invariant cache hit.
[2023-03-12 07:44:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 07:44:07] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2023-03-12 07:44:07] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-12 07:44:07] [INFO ] Invariant cache hit.
[2023-03-12 07:44:08] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2724 ms. Remains : 694/694 places, 1388/1388 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 694 transition count 1387
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 692 transition count 1387
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 691 transition count 1386
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 691 transition count 1385
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 691 transition count 1384
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 690 transition count 1384
Applied a total of 8 rules in 89 ms. Remains 690 /694 variables (removed 4) and now considering 1384/1388 (removed 4) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 1384 rows 690 cols
[2023-03-12 07:44:08] [INFO ] Computed 88 place invariants in 13 ms
[2023-03-12 07:44:08] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 07:44:08] [INFO ] [Nat]Absence check using 26 positive place invariants in 12 ms returned sat
[2023-03-12 07:44:09] [INFO ] [Nat]Absence check using 26 positive and 62 generalized place invariants in 40 ms returned sat
[2023-03-12 07:44:30] [INFO ] After 21456ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 07:44:41] [INFO ] Deduced a trap composed of 34 places in 348 ms of which 5 ms to minimize.
[2023-03-12 07:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 480 ms
[2023-03-12 07:44:41] [INFO ] After 32332ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 10557 ms.
[2023-03-12 07:44:52] [INFO ] After 43403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-12 07:44:52] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 07:44:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 694 places, 1388 transitions and 5378 arcs took 9 ms.
[2023-03-12 07:44:52] [INFO ] Flatten gal took : 159 ms
Total runtime 169363 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/547/inv_0_ --invariant=/tmp/547/inv_1_ --invariant=/tmp/547/inv_2_ --invariant=/tmp/547/inv_3_ --invariant=/tmp/547/inv_4_ --invariant=/tmp/547/inv_5_ --invariant=/tmp/547/inv_6_ --invariant=/tmp/547/inv_7_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 169532 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16268012 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-05a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-05a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r009-oct2-167813597400078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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