About the Execution of LTSMin+red for ASLink-PT-08a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
8676.928 | 3600000.00 | 13864751.00 | 55.30 | F??TTF??TT?T?FTT | 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-167813597500126.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-08a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500126
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:09 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 13:10 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 757K 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-08a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-08a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1678614097054
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-08a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 09:41:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 09:41:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 09:41:39] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-12 09:41:39] [INFO ] Transformed 1796 places.
[2023-03-12 09:41:39] [INFO ] Transformed 2646 transitions.
[2023-03-12 09:41:39] [INFO ] Found NUPN structural information;
[2023-03-12 09:41:40] [INFO ] Parsed PT model containing 1796 places and 2646 transitions and 9934 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA ASLink-PT-08a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08a-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 47 resets, run finished after 558 ms. (steps per millisecond=17 ) properties (out of 12) seen :5
FORMULA ASLink-PT-08a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2618 rows 1796 cols
[2023-03-12 09:41:41] [INFO ] Computed 346 place invariants in 126 ms
[2023-03-12 09:41:42] [INFO ] After 854ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 09:41:42] [INFO ] [Nat]Absence check using 85 positive place invariants in 33 ms returned sat
[2023-03-12 09:41:42] [INFO ] [Nat]Absence check using 85 positive and 261 generalized place invariants in 102 ms returned sat
[2023-03-12 09:42:07] [INFO ] After 24075ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:42:07] [INFO ] After 24084ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 09:42:07] [INFO ] After 25076ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 65 out of 1796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1796/1796 places, 2618/2618 transitions.
Ensure Unique test removed 32 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 143 transitions
Trivial Post-agglo rules discarded 143 transitions
Performed 143 trivial Post agglomeration. Transition count delta: 143
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 1750 transition count 2475
Reduce places removed 143 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 149 rules applied. Total rules applied 338 place count 1607 transition count 2469
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 344 place count 1601 transition count 2469
Performed 159 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 159 Pre rules applied. Total rules applied 344 place count 1601 transition count 2310
Deduced a syphon composed of 159 places in 10 ms
Ensure Unique test removed 56 places
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 3 with 374 rules applied. Total rules applied 718 place count 1386 transition count 2310
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 719 place count 1386 transition count 2309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 720 place count 1385 transition count 2309
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 730 place count 1375 transition count 2256
Ensure Unique test removed 1 places
Iterating global reduction 5 with 11 rules applied. Total rules applied 741 place count 1374 transition count 2256
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 743 place count 1374 transition count 2254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 743 place count 1374 transition count 2252
Deduced a syphon composed of 2 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 748 place count 1371 transition count 2252
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 749 place count 1370 transition count 2244
Iterating global reduction 6 with 1 rules applied. Total rules applied 750 place count 1370 transition count 2244
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 751 place count 1369 transition count 2236
Iterating global reduction 6 with 1 rules applied. Total rules applied 752 place count 1369 transition count 2236
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 753 place count 1368 transition count 2228
Iterating global reduction 6 with 1 rules applied. Total rules applied 754 place count 1368 transition count 2228
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 755 place count 1367 transition count 2220
Iterating global reduction 6 with 1 rules applied. Total rules applied 756 place count 1367 transition count 2220
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 7 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 844 place count 1323 transition count 2176
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 846 place count 1323 transition count 2174
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 848 place count 1321 transition count 2174
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 857 place count 1321 transition count 2165
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 866 place count 1312 transition count 2165
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 875 place count 1312 transition count 2165
Applied a total of 875 rules in 1063 ms. Remains 1312 /1796 variables (removed 484) and now considering 2165/2618 (removed 453) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1064 ms. Remains : 1312/1796 places, 2165/2618 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 78319 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 78319 steps, saw 41746 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2165 rows 1312 cols
[2023-03-12 09:42:11] [INFO ] Computed 242 place invariants in 26 ms
[2023-03-12 09:42:12] [INFO ] After 328ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 09:42:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2023-03-12 09:42:12] [INFO ] [Nat]Absence check using 66 positive and 176 generalized place invariants in 76 ms returned sat
[2023-03-12 09:42:37] [INFO ] After 24148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:42:37] [INFO ] State equation strengthened by 47 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 09:42:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 09:42:37] [INFO ] After 25048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 100 ms.
Support contains 65 out of 1312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1312/1312 places, 2165/2165 transitions.
Applied a total of 0 rules in 82 ms. Remains 1312 /1312 variables (removed 0) and now considering 2165/2165 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 1312/1312 places, 2165/2165 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1312/1312 places, 2165/2165 transitions.
Applied a total of 0 rules in 98 ms. Remains 1312 /1312 variables (removed 0) and now considering 2165/2165 (removed 0) transitions.
[2023-03-12 09:42:37] [INFO ] Invariant cache hit.
[2023-03-12 09:42:39] [INFO ] Implicit Places using invariants in 1894 ms returned [1, 19, 20, 22, 32, 50, 68, 148, 161, 162, 163, 164, 165, 183, 201, 273, 285, 298, 299, 300, 301, 302, 320, 338, 376, 405, 417, 429, 442, 443, 444, 445, 446, 464, 482, 521, 546, 568, 581, 582, 583, 584, 585, 603, 621, 672, 706, 720, 721, 722, 723, 724, 742, 760, 842, 859, 861, 862, 882, 900, 939, 953, 986, 999, 1000, 1001, 1002, 1003, 1021, 1039, 1077, 1093, 1123, 1128, 1140, 1141, 1142, 1143, 1144, 1174, 1176, 1179, 1197, 1199, 1200, 1201, 1213, 1219, 1225, 1231, 1237, 1243, 1249, 1255, 1261, 1267, 1273, 1311]
Discarding 98 places :
Implicit Place search using SMT only with invariants took 1900 ms to find 98 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1214/1312 places, 2165/2165 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 1214 transition count 2046
Reduce places removed 119 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 131 rules applied. Total rules applied 250 place count 1095 transition count 2034
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 262 place count 1083 transition count 2034
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 262 place count 1083 transition count 1981
Deduced a syphon composed of 53 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 107 rules applied. Total rules applied 369 place count 1029 transition count 1981
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 3 with 36 rules applied. Total rules applied 405 place count 1012 transition count 1962
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 21 rules applied. Total rules applied 426 place count 993 transition count 1960
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 428 place count 991 transition count 1960
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 428 place count 991 transition count 1959
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 430 place count 990 transition count 1959
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 446 place count 974 transition count 1943
Iterating global reduction 6 with 16 rules applied. Total rules applied 462 place count 974 transition count 1943
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 466 place count 974 transition count 1939
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 466 place count 974 transition count 1938
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 468 place count 973 transition count 1938
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 471 place count 970 transition count 1935
Iterating global reduction 7 with 3 rules applied. Total rules applied 474 place count 970 transition count 1935
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 475 place count 969 transition count 1934
Iterating global reduction 7 with 1 rules applied. Total rules applied 476 place count 969 transition count 1934
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 477 place count 968 transition count 1933
Iterating global reduction 7 with 1 rules applied. Total rules applied 478 place count 968 transition count 1933
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 7 with 132 rules applied. Total rules applied 610 place count 902 transition count 1867
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 616 place count 896 transition count 1861
Iterating global reduction 7 with 6 rules applied. Total rules applied 622 place count 896 transition count 1861
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 627 place count 896 transition count 1856
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 628 place count 896 transition count 1855
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 633 place count 896 transition count 1850
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 640 place count 891 transition count 1848
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 642 place count 891 transition count 1846
Free-agglomeration rule (complex) applied 24 times.
Iterating global reduction 9 with 24 rules applied. Total rules applied 666 place count 891 transition count 1822
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 9 with 24 rules applied. Total rules applied 690 place count 867 transition count 1822
Partial Free-agglomeration rule applied 19 times.
Drop transitions removed 19 transitions
Iterating global reduction 10 with 19 rules applied. Total rules applied 709 place count 867 transition count 1822
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 711 place count 867 transition count 1822
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 712 place count 866 transition count 1821
Iterating global reduction 10 with 1 rules applied. Total rules applied 713 place count 866 transition count 1821
Applied a total of 713 rules in 724 ms. Remains 866 /1214 variables (removed 348) and now considering 1821/2165 (removed 344) transitions.
// Phase 1: matrix 1821 rows 866 cols
[2023-03-12 09:42:40] [INFO ] Computed 126 place invariants in 56 ms
[2023-03-12 09:42:41] [INFO ] Implicit Places using invariants in 1096 ms returned [74, 91, 97, 100, 102, 105, 106, 158, 175, 181, 183, 191, 196, 197, 249, 269, 290, 295, 296, 348, 380, 382, 387, 392, 393, 445, 474, 477, 479, 480, 486, 487, 559, 566, 572, 576, 584, 585, 642, 681, 683, 684, 688, 693, 747, 775, 778, 780, 785, 864]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 1100 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 816/1312 places, 1821/2165 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 816 transition count 1819
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 814 transition count 1819
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 14 place count 804 transition count 1809
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 804 transition count 1809
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 801 transition count 1806
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 801 transition count 1806
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 56 place count 788 transition count 1793
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 787 transition count 1791
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 787 transition count 1791
Free-agglomeration rule applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 787 transition count 1775
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 90 place count 771 transition count 1775
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 94 place count 771 transition count 1771
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 98 place count 767 transition count 1771
Applied a total of 98 rules in 211 ms. Remains 767 /816 variables (removed 49) and now considering 1771/1821 (removed 50) transitions.
// Phase 1: matrix 1771 rows 767 cols
[2023-03-12 09:42:41] [INFO ] Computed 76 place invariants in 12 ms
[2023-03-12 09:42:42] [INFO ] Implicit Places using invariants in 560 ms returned []
[2023-03-12 09:42:42] [INFO ] Invariant cache hit.
[2023-03-12 09:42:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 09:42:44] [INFO ] Implicit Places using invariants and state equation in 2327 ms returned []
Implicit Place search using SMT with State Equation took 2918 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 767/1312 places, 1771/2165 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6951 ms. Remains : 767/1312 places, 1771/2165 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 235 ms. (steps per millisecond=42 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 107095 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{6=1}
Probabilistic random walk after 107095 steps, saw 63707 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :1
FORMULA ASLink-PT-08a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-12 09:42:48] [INFO ] Invariant cache hit.
[2023-03-12 09:42:48] [INFO ] After 204ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 09:42:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-12 09:42:48] [INFO ] [Nat]Absence check using 13 positive and 63 generalized place invariants in 90 ms returned sat
[2023-03-12 09:43:08] [INFO ] After 19401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:43:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 09:43:13] [INFO ] After 5045ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 09:43:13] [INFO ] After 5046ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 09:43:13] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 162 ms.
Support contains 48 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1771/1771 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 0 with 10 rules applied. Total rules applied 10 place count 767 transition count 1761
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 757 transition count 1761
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 757 transition count 1757
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 28 place count 753 transition count 1757
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 751 transition count 1757
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 748 transition count 1743
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 748 transition count 1743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 748 transition count 1742
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 38 place count 747 transition count 1734
Iterating global reduction 4 with 1 rules applied. Total rules applied 39 place count 747 transition count 1734
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 746 transition count 1726
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 746 transition count 1726
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 42 place count 745 transition count 1718
Iterating global reduction 4 with 1 rules applied. Total rules applied 43 place count 745 transition count 1718
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 44 place count 744 transition count 1710
Iterating global reduction 4 with 1 rules applied. Total rules applied 45 place count 744 transition count 1710
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 46 place count 743 transition count 1702
Iterating global reduction 4 with 1 rules applied. Total rules applied 47 place count 743 transition count 1702
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 48 place count 742 transition count 1694
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 742 transition count 1694
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 50 place count 741 transition count 1686
Iterating global reduction 4 with 1 rules applied. Total rules applied 51 place count 741 transition count 1686
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 52 place count 740 transition count 1678
Iterating global reduction 4 with 1 rules applied. Total rules applied 53 place count 740 transition count 1678
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 54 place count 739 transition count 1670
Iterating global reduction 4 with 1 rules applied. Total rules applied 55 place count 739 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 56 place count 738 transition count 1662
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 738 transition count 1662
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 58 place count 737 transition count 1654
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 737 transition count 1654
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 71 place count 731 transition count 1648
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 731 transition count 1646
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 75 place count 731 transition count 1644
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 79 place count 729 transition count 1642
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 729 transition count 1642
Applied a total of 80 rules in 330 ms. Remains 729 /767 variables (removed 38) and now considering 1642/1771 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 330 ms. Remains : 729/767 places, 1642/1771 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 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 20 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 22 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 15 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 132453 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132453 steps, saw 82221 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1642 rows 729 cols
[2023-03-12 09:43:17] [INFO ] Computed 74 place invariants in 15 ms
[2023-03-12 09:43:17] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 09:43:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 09:43:17] [INFO ] [Nat]Absence check using 13 positive and 61 generalized place invariants in 41 ms returned sat
[2023-03-12 09:43:31] [INFO ] After 13728ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 09:43:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 09:43:33] [INFO ] After 1645ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 09:43:42] [INFO ] After 10945ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 09:43:42] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 573 ms.
Support contains 48 out of 729 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 729/729 places, 1642/1642 transitions.
Applied a total of 0 rules in 21 ms. Remains 729 /729 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 729/729 places, 1642/1642 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 729/729 places, 1642/1642 transitions.
Applied a total of 0 rules in 22 ms. Remains 729 /729 variables (removed 0) and now considering 1642/1642 (removed 0) transitions.
[2023-03-12 09:43:43] [INFO ] Invariant cache hit.
[2023-03-12 09:43:43] [INFO ] Implicit Places using invariants in 505 ms returned [408, 497]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 521 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 727/729 places, 1642/1642 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 727 transition count 1638
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 723 transition count 1637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 722 transition count 1637
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 3 with 2 rules applied. Total rules applied 12 place count 721 transition count 1636
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 721 transition count 1635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 14 place count 720 transition count 1635
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 15 place count 720 transition count 1634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 16 place count 719 transition count 1634
Applied a total of 16 rules in 96 ms. Remains 719 /727 variables (removed 8) and now considering 1634/1642 (removed 8) transitions.
// Phase 1: matrix 1634 rows 719 cols
[2023-03-12 09:43:43] [INFO ] Computed 72 place invariants in 12 ms
[2023-03-12 09:43:44] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-12 09:43:44] [INFO ] Invariant cache hit.
[2023-03-12 09:43:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 09:43:46] [INFO ] Implicit Places using invariants and state equation in 2326 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 719/729 places, 1634/1642 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3500 ms. Remains : 719/729 places, 1634/1642 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 115639 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 115639 steps, saw 72332 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 09:43:50] [INFO ] Invariant cache hit.
[2023-03-12 09:43:50] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 09:43:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-12 09:43:50] [INFO ] [Nat]Absence check using 13 positive and 59 generalized place invariants in 21 ms returned sat
[2023-03-12 09:44:01] [INFO ] After 11225ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 09:44:01] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 09:44:03] [INFO ] After 1348ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 09:44:14] [INFO ] After 12303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1253 ms.
[2023-03-12 09:44:15] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 392 ms.
Support contains 48 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1634/1634 transitions.
Applied a total of 0 rules in 22 ms. Remains 719 /719 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 719/719 places, 1634/1634 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 1634/1634 transitions.
Applied a total of 0 rules in 21 ms. Remains 719 /719 variables (removed 0) and now considering 1634/1634 (removed 0) transitions.
[2023-03-12 09:44:15] [INFO ] Invariant cache hit.
[2023-03-12 09:44:16] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-12 09:44:16] [INFO ] Invariant cache hit.
[2023-03-12 09:44:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 09:44:18] [INFO ] Implicit Places using invariants and state equation in 2116 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
[2023-03-12 09:44:18] [INFO ] Redundant transitions in 146 ms returned []
[2023-03-12 09:44:18] [INFO ] Invariant cache hit.
[2023-03-12 09:44:19] [INFO ] Dead Transitions using invariants and state equation in 607 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3531 ms. Remains : 719/719 places, 1634/1634 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 719 transition count 1633
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 2 place count 718 transition count 1633
Applied a total of 2 rules in 26 ms. Remains 718 /719 variables (removed 1) and now considering 1633/1634 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1633 rows 718 cols
[2023-03-12 09:44:19] [INFO ] Computed 72 place invariants in 12 ms
[2023-03-12 09:44:19] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 09:44:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 108 ms returned sat
[2023-03-12 09:44:20] [INFO ] [Nat]Absence check using 15 positive and 57 generalized place invariants in 64 ms returned sat
[2023-03-12 09:44:40] [INFO ] After 20603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 09:44:47] [INFO ] After 27531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 736 ms.
[2023-03-12 09:44:48] [INFO ] After 29027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-12 09:44:48] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2023-03-12 09:44:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 719 places, 1634 transitions and 6574 arcs took 20 ms.
[2023-03-12 09:44:49] [INFO ] Flatten gal took : 163 ms
Total runtime 189362 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/566/inv_0_ --invariant=/tmp/566/inv_1_ --invariant=/tmp/566/inv_2_ --invariant=/tmp/566/inv_3_ --invariant=/tmp/566/inv_4_ --invariant=/tmp/566/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7470116 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095740 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-08a"
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-08a, 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-167813597500126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08a.tgz
mv ASLink-PT-08a 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 '
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 ;