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-167813597500142.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-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 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 839K 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-09a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-09a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678616516845

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-09a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:22:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 10:22:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:22:00] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2023-03-12 10:22:00] [INFO ] Transformed 1991 places.
[2023-03-12 10:22:00] [INFO ] Transformed 2919 transitions.
[2023-03-12 10:22:00] [INFO ] Found NUPN structural information;
[2023-03-12 10:22:00] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 420 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 30 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
FORMULA ASLink-PT-09a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-09a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 48 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 13) seen :7
FORMULA ASLink-PT-09a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2888 rows 1991 cols
[2023-03-12 10:22:01] [INFO ] Computed 384 place invariants in 133 ms
[2023-03-12 10:22:02] [INFO ] [Real]Absence check using 93 positive place invariants in 44 ms returned sat
[2023-03-12 10:22:03] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 200 ms returned sat
[2023-03-12 10:22:03] [INFO ] After 1375ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:22:04] [INFO ] [Nat]Absence check using 93 positive place invariants in 34 ms returned sat
[2023-03-12 10:22:04] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 180 ms returned sat
[2023-03-12 10:22:28] [INFO ] After 23378ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 10:22:28] [INFO ] After 23384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-12 10:22:28] [INFO ] After 25030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 99 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 17 places :
Implicit places reduction removed 17 places
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 201 rules applied. Total rules applied 201 place count 1938 transition count 2740
Reduce places removed 148 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 159 rules applied. Total rules applied 360 place count 1790 transition count 2729
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 371 place count 1779 transition count 2729
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 371 place count 1779 transition count 2562
Deduced a syphon composed of 167 places in 8 ms
Ensure Unique test removed 57 places
Reduce places removed 224 places and 0 transitions.
Iterating global reduction 3 with 391 rules applied. Total rules applied 762 place count 1555 transition count 2562
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 763 place count 1555 transition count 2561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 764 place count 1554 transition count 2561
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 776 place count 1542 transition count 2496
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 789 place count 1541 transition count 2496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 792 place count 1541 transition count 2493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 793 place count 1540 transition count 2493
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 793 place count 1540 transition count 2491
Deduced a syphon composed of 2 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 5 rules applied. Total rules applied 798 place count 1537 transition count 2491
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 799 place count 1536 transition count 2483
Iterating global reduction 7 with 1 rules applied. Total rules applied 800 place count 1536 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 801 place count 1535 transition count 2475
Iterating global reduction 7 with 1 rules applied. Total rules applied 802 place count 1535 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 803 place count 1534 transition count 2467
Iterating global reduction 7 with 1 rules applied. Total rules applied 804 place count 1534 transition count 2467
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 805 place count 1533 transition count 2459
Iterating global reduction 7 with 1 rules applied. Total rules applied 806 place count 1533 transition count 2459
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 807 place count 1532 transition count 2451
Iterating global reduction 7 with 1 rules applied. Total rules applied 808 place count 1532 transition count 2451
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 809 place count 1531 transition count 2443
Iterating global reduction 7 with 1 rules applied. Total rules applied 810 place count 1531 transition count 2443
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 811 place count 1530 transition count 2435
Iterating global reduction 7 with 1 rules applied. Total rules applied 812 place count 1530 transition count 2435
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 813 place count 1529 transition count 2427
Iterating global reduction 7 with 1 rules applied. Total rules applied 814 place count 1529 transition count 2427
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 815 place count 1528 transition count 2419
Iterating global reduction 7 with 1 rules applied. Total rules applied 816 place count 1528 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 817 place count 1527 transition count 2411
Iterating global reduction 7 with 1 rules applied. Total rules applied 818 place count 1527 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 819 place count 1526 transition count 2403
Iterating global reduction 7 with 1 rules applied. Total rules applied 820 place count 1526 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 821 place count 1525 transition count 2395
Iterating global reduction 7 with 1 rules applied. Total rules applied 822 place count 1525 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 823 place count 1524 transition count 2387
Iterating global reduction 7 with 1 rules applied. Total rules applied 824 place count 1524 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 825 place count 1523 transition count 2379
Iterating global reduction 7 with 1 rules applied. Total rules applied 826 place count 1523 transition count 2379
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 5 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 7 with 112 rules applied. Total rules applied 938 place count 1467 transition count 2323
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 939 place count 1467 transition count 2322
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 940 place count 1466 transition count 2322
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 950 place count 1466 transition count 2312
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 960 place count 1456 transition count 2312
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 968 place count 1456 transition count 2312
Applied a total of 968 rules in 1921 ms. Remains 1456 /1991 variables (removed 535) and now considering 2312/2888 (removed 576) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1922 ms. Remains : 1456/1991 places, 2312/2888 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 70530 steps, run timeout after 3004 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 70530 steps, saw 40046 distinct states, run finished after 3006 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 2312 rows 1456 cols
[2023-03-12 10:22:34] [INFO ] Computed 272 place invariants in 83 ms
[2023-03-12 10:22:34] [INFO ] [Real]Absence check using 69 positive place invariants in 32 ms returned sat
[2023-03-12 10:22:34] [INFO ] [Real]Absence check using 69 positive and 203 generalized place invariants in 70 ms returned sat
[2023-03-12 10:22:34] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 10:22:35] [INFO ] [Nat]Absence check using 69 positive place invariants in 53 ms returned sat
[2023-03-12 10:22:35] [INFO ] [Nat]Absence check using 69 positive and 203 generalized place invariants in 102 ms returned sat
[2023-03-12 10:22:59] [INFO ] After 24270ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:22:59] [INFO ] State equation strengthened by 48 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 10:22:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:22:59] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 99 out of 1456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 2312/2312 transitions.
Applied a total of 0 rules in 81 ms. Remains 1456 /1456 variables (removed 0) and now considering 2312/2312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1456/1456 places, 2312/2312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1456/1456 places, 2312/2312 transitions.
Applied a total of 0 rules in 135 ms. Remains 1456 /1456 variables (removed 0) and now considering 2312/2312 (removed 0) transitions.
[2023-03-12 10:23:00] [INFO ] Invariant cache hit.
[2023-03-12 10:23:01] [INFO ] Implicit Places using invariants in 1706 ms returned [1, 19, 20, 22, 32, 50, 68, 142, 154, 168, 169, 170, 171, 172, 190, 208, 261, 274, 282, 298, 311, 312, 313, 314, 315, 333, 351, 387, 434, 447, 448, 449, 450, 451, 469, 487, 527, 554, 568, 580, 594, 597, 598, 616, 634, 717, 734, 735, 736, 737, 755, 773, 812, 838, 849, 861, 875, 878, 879, 880, 898, 916, 998, 1011, 1012, 1013, 1014, 1015, 1033, 1051, 1087, 1116, 1136, 1149, 1154, 1155, 1156, 1174, 1192, 1230, 1247, 1267, 1279, 1284, 1295, 1296, 1297, 1298, 1299, 1319, 1321, 1324, 1342, 1343, 1344, 1345, 1357, 1363, 1369, 1375, 1381, 1387, 1393, 1399, 1405, 1411, 1417, 1453]
Discarding 108 places :
Implicit Place search using SMT only with invariants took 1713 ms to find 108 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1348/1456 places, 2312/2312 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 1348 transition count 2194
Reduce places removed 118 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 138 rules applied. Total rules applied 256 place count 1230 transition count 2174
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 276 place count 1210 transition count 2174
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 276 place count 1210 transition count 2129
Deduced a syphon composed of 45 places in 4 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 366 place count 1165 transition count 2129
Discarding 15 places :
Implicit places reduction removed 15 places
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 27 rules applied. Total rules applied 393 place count 1150 transition count 2117
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 405 place count 1138 transition count 2117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 405 place count 1138 transition count 2116
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 407 place count 1137 transition count 2116
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 418 place count 1126 transition count 2105
Iterating global reduction 5 with 11 rules applied. Total rules applied 429 place count 1126 transition count 2105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 430 place count 1126 transition count 2104
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 434 place count 1122 transition count 2100
Iterating global reduction 6 with 4 rules applied. Total rules applied 438 place count 1122 transition count 2100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 439 place count 1122 transition count 2099
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 440 place count 1121 transition count 2098
Iterating global reduction 7 with 1 rules applied. Total rules applied 441 place count 1121 transition count 2098
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 442 place count 1120 transition count 2097
Iterating global reduction 7 with 1 rules applied. Total rules applied 443 place count 1120 transition count 2097
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 3 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 7 with 150 rules applied. Total rules applied 593 place count 1045 transition count 2022
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 597 place count 1041 transition count 2018
Iterating global reduction 7 with 4 rules applied. Total rules applied 601 place count 1041 transition count 2018
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 603 place count 1041 transition count 2016
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 605 place count 1041 transition count 2014
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 611 place count 1041 transition count 2008
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 619 place count 1035 transition count 2006
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 620 place count 1035 transition count 2005
Free-agglomeration rule (complex) applied 30 times.
Iterating global reduction 9 with 30 rules applied. Total rules applied 650 place count 1035 transition count 1975
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 9 with 31 rules applied. Total rules applied 681 place count 1004 transition count 1975
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 682 place count 1004 transition count 1974
Partial Free-agglomeration rule applied 23 times.
Drop transitions removed 23 transitions
Iterating global reduction 10 with 23 rules applied. Total rules applied 705 place count 1004 transition count 1974
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 709 place count 1004 transition count 1974
Applied a total of 709 rules in 713 ms. Remains 1004 /1348 variables (removed 344) and now considering 1974/2312 (removed 338) transitions.
// Phase 1: matrix 1974 rows 1004 cols
[2023-03-12 10:23:02] [INFO ] Computed 148 place invariants in 45 ms
[2023-03-12 10:23:03] [INFO ] Implicit Places using invariants in 860 ms returned [91, 97, 120, 121, 174, 208, 218, 223, 224, 296, 302, 305, 307, 310, 315, 316, 419, 427, 428, 482, 500, 508, 511, 513, 519, 524, 525, 601, 612, 619, 627, 628, 683, 706, 717, 719, 720, 725, 803, 814, 816, 819, 826, 827, 883, 912, 915, 921, 996, 1000]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 871 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 954/1456 places, 1974/2312 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 941 transition count 1961
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 941 transition count 1961
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1960
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1960
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 48 place count 930 transition count 1950
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 49 place count 930 transition count 1949
Free-agglomeration rule applied 14 times.
Iterating global reduction 0 with 14 rules applied. Total rules applied 63 place count 930 transition count 1935
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 77 place count 916 transition count 1935
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 79 place count 916 transition count 1933
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 81 place count 914 transition count 1933
Applied a total of 81 rules in 199 ms. Remains 914 /954 variables (removed 40) and now considering 1933/1974 (removed 41) transitions.
// Phase 1: matrix 1933 rows 914 cols
[2023-03-12 10:23:03] [INFO ] Computed 98 place invariants in 29 ms
[2023-03-12 10:23:04] [INFO ] Implicit Places using invariants in 632 ms returned []
[2023-03-12 10:23:04] [INFO ] Invariant cache hit.
[2023-03-12 10:23:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-12 10:23:07] [INFO ] Implicit Places using invariants and state equation in 3463 ms returned []
Implicit Place search using SMT with State Equation took 4098 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 914/1456 places, 1933/2312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 7731 ms. Remains : 914/1456 places, 1933/2312 transitions.
Incomplete random walk after 10000 steps, including 95 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 6) seen :1
FORMULA ASLink-PT-09a-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:23:08] [INFO ] Invariant cache hit.
[2023-03-12 10:23:08] [INFO ] [Real]Absence check using 22 positive place invariants in 14 ms returned sat
[2023-03-12 10:23:08] [INFO ] [Real]Absence check using 22 positive and 76 generalized place invariants in 50 ms returned sat
[2023-03-12 10:23:08] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:23:08] [INFO ] [Nat]Absence check using 22 positive place invariants in 20 ms returned sat
[2023-03-12 10:23:08] [INFO ] [Nat]Absence check using 22 positive and 76 generalized place invariants in 36 ms returned sat
[2023-03-12 10:23:33] [INFO ] After 24568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:23:33] [INFO ] State equation strengthened by 13 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 10:23:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:23:33] [INFO ] After 25062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 146 ms.
Support contains 80 out of 914 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 914/914 places, 1933/1933 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 914 transition count 1927
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 11 rules applied. Total rules applied 17 place count 908 transition count 1922
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 903 transition count 1922
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 903 transition count 1917
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 898 transition count 1917
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 33 place count 897 transition count 1917
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 4 with 4 rules applied. Total rules applied 37 place count 895 transition count 1915
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 895 transition count 1914
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 40 place count 895 transition count 1912
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 43 place count 893 transition count 1911
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 893 transition count 1910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 45 place count 892 transition count 1910
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 48 place count 892 transition count 1910
Applied a total of 48 rules in 207 ms. Remains 892 /914 variables (removed 22) and now considering 1910/1933 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 892/914 places, 1910/1933 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 137424 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 137424 steps, saw 49575 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1910 rows 892 cols
[2023-03-12 10:23:37] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-12 10:23:37] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-12 10:23:38] [INFO ] [Real]Absence check using 21 positive and 76 generalized place invariants in 132 ms returned sat
[2023-03-12 10:23:38] [INFO ] After 464ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:23:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 15 ms returned sat
[2023-03-12 10:23:38] [INFO ] [Nat]Absence check using 21 positive and 76 generalized place invariants in 48 ms returned sat
[2023-03-12 10:24:01] [INFO ] After 23099ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:24:01] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-12 10:24:03] [INFO ] After 1270ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:24:03] [INFO ] After 1271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 10:24:03] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 233 ms.
Support contains 80 out of 892 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 892/892 places, 1910/1910 transitions.
Applied a total of 0 rules in 29 ms. Remains 892 /892 variables (removed 0) and now considering 1910/1910 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 892/892 places, 1910/1910 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 892/892 places, 1910/1910 transitions.
Applied a total of 0 rules in 24 ms. Remains 892 /892 variables (removed 0) and now considering 1910/1910 (removed 0) transitions.
[2023-03-12 10:24:03] [INFO ] Invariant cache hit.
[2023-03-12 10:24:04] [INFO ] Implicit Places using invariants in 644 ms returned [367, 384, 543]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 646 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 889/892 places, 1910/1910 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 889 transition count 1908
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 4 place count 887 transition count 1908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 886 transition count 1907
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 886 transition count 1907
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 885 transition count 1906
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 885 transition count 1905
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 10 place count 884 transition count 1905
Applied a total of 10 rules in 178 ms. Remains 884 /889 variables (removed 5) and now considering 1905/1910 (removed 5) transitions.
// Phase 1: matrix 1905 rows 884 cols
[2023-03-12 10:24:04] [INFO ] Computed 94 place invariants in 13 ms
[2023-03-12 10:24:04] [INFO ] Implicit Places using invariants in 727 ms returned [375, 376]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 747 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 882/892 places, 1905/1910 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 881 transition count 1904
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 881 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 880 transition count 1903
Applied a total of 4 rules in 112 ms. Remains 880 /882 variables (removed 2) and now considering 1903/1905 (removed 2) transitions.
// Phase 1: matrix 1903 rows 880 cols
[2023-03-12 10:24:05] [INFO ] Computed 92 place invariants in 14 ms
[2023-03-12 10:24:05] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-12 10:24:06] [INFO ] Invariant cache hit.
[2023-03-12 10:24:07] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 10:24:09] [INFO ] Implicit Places using invariants and state equation in 3815 ms returned []
Implicit Place search using SMT with State Equation took 4732 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 880/892 places, 1903/1910 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6439 ms. Remains : 880/892 places, 1903/1910 transitions.
Incomplete random walk after 10000 steps, including 114 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 147362 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147362 steps, saw 56771 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 10:24:13] [INFO ] Invariant cache hit.
[2023-03-12 10:24:13] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-12 10:24:13] [INFO ] [Real]Absence check using 17 positive and 75 generalized place invariants in 68 ms returned sat
[2023-03-12 10:24:13] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:24:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-12 10:24:13] [INFO ] [Nat]Absence check using 17 positive and 75 generalized place invariants in 62 ms returned sat
[2023-03-12 10:24:38] [INFO ] After 24568ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 10:24:38] [INFO ] State equation strengthened by 12 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
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 10:24:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 10:24:38] [INFO ] After 25058ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 223 ms.
Support contains 80 out of 880 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 1903/1903 transitions.
Applied a total of 0 rules in 24 ms. Remains 880 /880 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 880/880 places, 1903/1903 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 880/880 places, 1903/1903 transitions.
Applied a total of 0 rules in 30 ms. Remains 880 /880 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
[2023-03-12 10:24:39] [INFO ] Invariant cache hit.
[2023-03-12 10:24:39] [INFO ] Implicit Places using invariants in 836 ms returned []
[2023-03-12 10:24:39] [INFO ] Invariant cache hit.
[2023-03-12 10:24:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-12 10:24:43] [INFO ] Implicit Places using invariants and state equation in 4053 ms returned []
Implicit Place search using SMT with State Equation took 4894 ms to find 0 implicit places.
[2023-03-12 10:24:44] [INFO ] Redundant transitions in 240 ms returned []
[2023-03-12 10:24:44] [INFO ] Invariant cache hit.
[2023-03-12 10:24:45] [INFO ] Dead Transitions using invariants and state equation in 1122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6310 ms. Remains : 880/880 places, 1903/1903 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 880 transition count 1902
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 879 transition count 1902
Applied a total of 2 rules in 35 ms. Remains 879 /880 variables (removed 1) and now considering 1902/1903 (removed 1) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1902 rows 879 cols
[2023-03-12 10:24:45] [INFO ] Computed 92 place invariants in 19 ms
[2023-03-12 10:24:45] [INFO ] [Real]Absence check using 21 positive place invariants in 19 ms returned sat
[2023-03-12 10:24:45] [INFO ] [Real]Absence check using 21 positive and 71 generalized place invariants in 119 ms returned sat
[2023-03-12 10:24:45] [INFO ] After 538ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 10:24:46] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-12 10:24:46] [INFO ] [Nat]Absence check using 21 positive and 71 generalized place invariants in 30 ms returned sat
[2023-03-12 10:25:13] [INFO ] After 26955ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 10:25:13] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 21 ms to minimize.
[2023-03-12 10:25:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 454 ms
[2023-03-12 10:25:23] [INFO ] After 36869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 464 ms.
[2023-03-12 10:25:23] [INFO ] After 37589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 10:25:23] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2023-03-12 10:25:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 880 places, 1903 transitions and 7566 arcs took 11 ms.
[2023-03-12 10:25:24] [INFO ] Flatten gal took : 221 ms
Total runtime 204205 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/569/inv_0_ --invariant=/tmp/569/inv_1_ --invariant=/tmp/569/inv_2_ --invariant=/tmp/569/inv_3_ --invariant=/tmp/569/inv_4_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 156368 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16297388 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-09a"
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-09a, 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-167813597500142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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