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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 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.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 597K 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-06a-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678609903809

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-06a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:31:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 08:31:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:31:46] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2023-03-12 08:31:46] [INFO ] Transformed 1406 places.
[2023-03-12 08:31:46] [INFO ] Transformed 2100 transitions.
[2023-03-12 08:31:46] [INFO ] Found NUPN structural information;
[2023-03-12 08:31:46] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 256 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
Incomplete random walk after 10000 steps, including 52 resets, run finished after 522 ms. (steps per millisecond=19 ) properties (out of 16) seen :5
FORMULA ASLink-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-12 08:31:48] [INFO ] Computed 270 place invariants in 96 ms
[2023-03-12 08:31:49] [INFO ] After 845ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-12 08:31:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 39 ms returned sat
[2023-03-12 08:31:49] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 70 ms returned sat
[2023-03-12 08:32:14] [INFO ] After 23891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 08:32:14] [INFO ] After 23902ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 08:32:14] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 100 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 1371 transition count 1979
Reduce places removed 99 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 109 rules applied. Total rules applied 243 place count 1272 transition count 1969
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 253 place count 1262 transition count 1969
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 253 place count 1262 transition count 1855
Deduced a syphon composed of 114 places in 4 ms
Ensure Unique test removed 38 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 266 rules applied. Total rules applied 519 place count 1110 transition count 1855
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 528 place count 1101 transition count 1808
Ensure Unique test removed 1 places
Iterating global reduction 3 with 10 rules applied. Total rules applied 538 place count 1100 transition count 1808
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 544 place count 1099 transition count 1803
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 547 place count 1096 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 548 place count 1095 transition count 1795
Iterating global reduction 5 with 1 rules applied. Total rules applied 549 place count 1095 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 550 place count 1094 transition count 1787
Iterating global reduction 5 with 1 rules applied. Total rules applied 551 place count 1094 transition count 1787
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 552 place count 1093 transition count 1779
Iterating global reduction 5 with 1 rules applied. Total rules applied 553 place count 1093 transition count 1779
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 554 place count 1092 transition count 1771
Iterating global reduction 5 with 1 rules applied. Total rules applied 555 place count 1092 transition count 1771
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 6 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 629 place count 1055 transition count 1734
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 631 place count 1055 transition count 1732
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 633 place count 1053 transition count 1732
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 637 place count 1053 transition count 1728
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 641 place count 1049 transition count 1728
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 648 place count 1049 transition count 1728
Applied a total of 648 rules in 740 ms. Remains 1049 /1406 variables (removed 357) and now considering 1728/2078 (removed 350) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 741 ms. Remains : 1049/1406 places, 1728/2078 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 357 ms. (steps per millisecond=28 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 1728 rows 1049 cols
[2023-03-12 08:32:16] [INFO ] Computed 195 place invariants in 46 ms
[2023-03-12 08:32:16] [INFO ] After 321ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-12 08:32:16] [INFO ] [Nat]Absence check using 56 positive place invariants in 20 ms returned sat
[2023-03-12 08:32:16] [INFO ] [Nat]Absence check using 56 positive and 139 generalized place invariants in 55 ms returned sat
[2023-03-12 08:32:41] [INFO ] After 24388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 08:32:41] [INFO ] State equation strengthened by 30 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 08:32:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 08:32:41] [INFO ] After 25041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 418 ms.
Support contains 89 out of 1049 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1049/1049 places, 1728/1728 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 0 with 1 rules applied. Total rules applied 1 place count 1049 transition count 1727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1048 transition count 1727
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 1048 transition count 1724
Deduced a syphon composed of 3 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 1043 transition count 1724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 1042 transition count 1716
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 1042 transition count 1716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 1041 transition count 1708
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 1041 transition count 1708
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 1040 transition count 1700
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 1040 transition count 1700
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 1039 transition count 1692
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 1039 transition count 1692
Applied a total of 18 rules in 282 ms. Remains 1039 /1049 variables (removed 10) and now considering 1692/1728 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 1039/1049 places, 1692/1728 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 9) seen :1
FORMULA ASLink-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1692 rows 1039 cols
[2023-03-12 08:32:43] [INFO ] Computed 193 place invariants in 14 ms
[2023-03-12 08:32:43] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 08:32:43] [INFO ] [Nat]Absence check using 52 positive place invariants in 71 ms returned sat
[2023-03-12 08:32:43] [INFO ] [Nat]Absence check using 52 positive and 141 generalized place invariants in 35 ms returned sat
[2023-03-12 08:33:08] [INFO ] After 24409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-12 08:33:08] [INFO ] State equation strengthened by 30 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 08:33:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 08:33:08] [INFO ] After 25056ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Parikh walk visited 0 properties in 430 ms.
Support contains 88 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1692/1692 transitions.
Applied a total of 0 rules in 40 ms. Remains 1039 /1039 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 1039/1039 places, 1692/1692 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 147296 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147296 steps, saw 40541 distinct states, run finished after 3006 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 8 properties.
[2023-03-12 08:33:12] [INFO ] Invariant cache hit.
[2023-03-12 08:33:13] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 08:33:13] [INFO ] [Nat]Absence check using 52 positive place invariants in 15 ms returned sat
[2023-03-12 08:33:13] [INFO ] [Nat]Absence check using 52 positive and 141 generalized place invariants in 120 ms returned sat
[2023-03-12 08:33:38] [INFO ] After 24219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 08:33:38] [INFO ] State equation strengthened by 30 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 08:33:38] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 08:33:38] [INFO ] After 25035ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 383 ms.
Support contains 88 out of 1039 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1692/1692 transitions.
Applied a total of 0 rules in 36 ms. Remains 1039 /1039 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1039/1039 places, 1692/1692 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1039/1039 places, 1692/1692 transitions.
Applied a total of 0 rules in 31 ms. Remains 1039 /1039 variables (removed 0) and now considering 1692/1692 (removed 0) transitions.
[2023-03-12 08:33:38] [INFO ] Invariant cache hit.
[2023-03-12 08:33:39] [INFO ] Implicit Places using invariants in 1188 ms returned [1, 19, 20, 22, 32, 50, 68, 149, 163, 165, 166, 167, 185, 203, 239, 277, 289, 302, 303, 304, 305, 306, 342, 381, 398, 418, 433, 447, 448, 449, 450, 451, 469, 487, 551, 571, 584, 585, 586, 587, 588, 606, 624, 712, 726, 729, 730, 731, 749, 767, 830, 850, 855, 866, 870, 871, 872, 898, 900, 903, 921, 922, 924, 925, 938, 944, 950, 956, 974, 980, 986, 992, 998, 1027]
Discarding 74 places :
Implicit Place search using SMT only with invariants took 1196 ms to find 74 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 965/1039 places, 1692/1692 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 965 transition count 1602
Reduce places removed 90 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 101 rules applied. Total rules applied 191 place count 875 transition count 1591
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 202 place count 864 transition count 1591
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 202 place count 864 transition count 1559
Deduced a syphon composed of 32 places in 9 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 266 place count 832 transition count 1559
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 18 rules applied. Total rules applied 284 place count 822 transition count 1551
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 9 rules applied. Total rules applied 293 place count 814 transition count 1550
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 294 place count 813 transition count 1550
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 305 place count 802 transition count 1539
Iterating global reduction 6 with 11 rules applied. Total rules applied 316 place count 802 transition count 1539
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 317 place count 802 transition count 1538
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 320 place count 799 transition count 1535
Iterating global reduction 7 with 3 rules applied. Total rules applied 323 place count 799 transition count 1535
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 324 place count 798 transition count 1534
Iterating global reduction 7 with 1 rules applied. Total rules applied 325 place count 798 transition count 1534
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 326 place count 797 transition count 1533
Iterating global reduction 7 with 1 rules applied. Total rules applied 327 place count 797 transition count 1533
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 7 with 90 rules applied. Total rules applied 417 place count 752 transition count 1488
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 419 place count 750 transition count 1486
Iterating global reduction 7 with 2 rules applied. Total rules applied 421 place count 750 transition count 1486
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 423 place count 750 transition count 1484
Free-agglomeration rule applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 427 place count 750 transition count 1480
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 432 place count 746 transition count 1479
Free-agglomeration rule (complex) applied 26 times.
Iterating global reduction 9 with 26 rules applied. Total rules applied 458 place count 746 transition count 1453
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 9 with 26 rules applied. Total rules applied 484 place count 720 transition count 1453
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 10 with 14 rules applied. Total rules applied 498 place count 720 transition count 1453
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 504 place count 720 transition count 1453
Applied a total of 504 rules in 374 ms. Remains 720 /965 variables (removed 245) and now considering 1453/1692 (removed 239) transitions.
// Phase 1: matrix 1453 rows 720 cols
[2023-03-12 08:33:40] [INFO ] Computed 109 place invariants in 11 ms
[2023-03-12 08:33:40] [INFO ] Implicit Places using invariants in 734 ms returned [92, 98, 101, 103, 107, 114, 115, 189, 198, 201, 210, 211, 216, 217, 271, 309, 323, 328, 329, 382, 401, 413, 415, 416, 510, 513, 515, 519, 606, 620, 623, 698, 701, 708, 714]
Discarding 35 places :
Implicit Place search using SMT only with invariants took 759 ms to find 35 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 685/1039 places, 1453/1692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 674 transition count 1442
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 674 transition count 1442
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 673 transition count 1441
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 673 transition count 1441
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 667 transition count 1435
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 667 transition count 1426
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 658 transition count 1426
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 658 transition count 1424
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 58 place count 656 transition count 1424
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 656 transition count 1424
Applied a total of 61 rules in 237 ms. Remains 656 /685 variables (removed 29) and now considering 1424/1453 (removed 29) transitions.
// Phase 1: matrix 1424 rows 656 cols
[2023-03-12 08:33:41] [INFO ] Computed 74 place invariants in 28 ms
[2023-03-12 08:33:41] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 08:33:41] [INFO ] Invariant cache hit.
[2023-03-12 08:33:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 08:33:43] [INFO ] Implicit Places using invariants and state equation in 2141 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 656/1039 places, 1424/1692 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5132 ms. Remains : 656/1039 places, 1424/1692 transitions.
Incomplete random walk after 10000 steps, including 141 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 187712 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{3=1, 4=1}
Probabilistic random walk after 187712 steps, saw 52252 distinct states, run finished after 3003 ms. (steps per millisecond=62 ) properties seen :2
FORMULA ASLink-PT-06a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-06a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 6 properties.
[2023-03-12 08:33:47] [INFO ] Invariant cache hit.
[2023-03-12 08:33:47] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:33:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-12 08:33:47] [INFO ] [Nat]Absence check using 18 positive and 56 generalized place invariants in 57 ms returned sat
[2023-03-12 08:34:03] [INFO ] After 15423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 08:34:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-12 08:34:12] [INFO ] After 9192ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 08:34:12] [INFO ] After 9193ms 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 08:34:12] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 328 ms.
Support contains 45 out of 656 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 656/656 places, 1424/1424 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 656 transition count 1416
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 648 transition count 1416
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 16 place count 648 transition count 1405
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 40 place count 635 transition count 1405
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 634 transition count 1405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 41 place count 634 transition count 1403
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 632 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 47 place count 630 transition count 1394
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 place count 630 transition count 1394
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 629 transition count 1386
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 629 transition count 1386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 628 transition count 1378
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 628 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 627 transition count 1370
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 627 transition count 1370
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 69 place count 620 transition count 1363
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 74 place count 620 transition count 1358
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 620 transition count 1354
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 82 place count 616 transition count 1354
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 83 place count 616 transition count 1353
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 86 place count 616 transition count 1350
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 89 place count 613 transition count 1350
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 90 place count 612 transition count 1349
Iterating global reduction 5 with 1 rules applied. Total rules applied 91 place count 612 transition count 1349
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 92 place count 612 transition count 1348
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 93 place count 612 transition count 1347
Applied a total of 93 rules in 186 ms. Remains 612 /656 variables (removed 44) and now considering 1347/1424 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 612/656 places, 1347/1424 transitions.
Incomplete random walk after 10000 steps, including 122 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 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 27 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 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 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 200531 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200531 steps, saw 55496 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1347 rows 612 cols
[2023-03-12 08:34:16] [INFO ] Computed 71 place invariants in 10 ms
[2023-03-12 08:34:16] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:34:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 5 ms returned sat
[2023-03-12 08:34:17] [INFO ] [Nat]Absence check using 17 positive and 54 generalized place invariants in 38 ms returned sat
[2023-03-12 08:34:36] [INFO ] After 19303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 08:34:36] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-12 08:34:39] [INFO ] After 2728ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 08:34:39] [INFO ] After 3432ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1977 ms.
[2023-03-12 08:34:41] [INFO ] After 25021ms 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 47 ms.
Support contains 45 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1347/1347 transitions.
Applied a total of 0 rules in 29 ms. Remains 612 /612 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 612/612 places, 1347/1347 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 1347/1347 transitions.
Applied a total of 0 rules in 21 ms. Remains 612 /612 variables (removed 0) and now considering 1347/1347 (removed 0) transitions.
[2023-03-12 08:34:42] [INFO ] Invariant cache hit.
[2023-03-12 08:34:42] [INFO ] Implicit Places using invariants in 577 ms returned [97, 268, 431, 450, 523, 604]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 579 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 606/612 places, 1347/1347 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 606 transition count 1343
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 602 transition count 1343
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 599 transition count 1340
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 599 transition count 1340
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 597 transition count 1338
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 597 transition count 1338
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 594 transition count 1335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 593 transition count 1334
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 593 transition count 1334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 592 transition count 1333
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 592 transition count 1333
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 31 place count 592 transition count 1330
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 34 place count 589 transition count 1330
Applied a total of 34 rules in 112 ms. Remains 589 /606 variables (removed 17) and now considering 1330/1347 (removed 17) transitions.
// Phase 1: matrix 1330 rows 589 cols
[2023-03-12 08:34:42] [INFO ] Computed 65 place invariants in 18 ms
[2023-03-12 08:34:43] [INFO ] Implicit Places using invariants in 560 ms returned [89, 90, 422, 423]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 561 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 585/612 places, 1330/1347 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 584 transition count 1329
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 584 transition count 1329
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 582 transition count 1327
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 582 transition count 1325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 580 transition count 1325
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 580 transition count 1325
Applied a total of 11 rules in 69 ms. Remains 580 /585 variables (removed 5) and now considering 1325/1330 (removed 5) transitions.
// Phase 1: matrix 1325 rows 580 cols
[2023-03-12 08:34:43] [INFO ] Computed 61 place invariants in 29 ms
[2023-03-12 08:34:43] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 08:34:43] [INFO ] Invariant cache hit.
[2023-03-12 08:34:44] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:34:45] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 2521 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 580/612 places, 1325/1347 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3864 ms. Remains : 580/612 places, 1325/1347 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 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 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 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 29 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 173911 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173911 steps, saw 51889 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-12 08:34:49] [INFO ] Invariant cache hit.
[2023-03-12 08:34:49] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:34:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 42 ms returned sat
[2023-03-12 08:34:49] [INFO ] [Nat]Absence check using 16 positive and 45 generalized place invariants in 18 ms returned sat
[2023-03-12 08:35:00] [INFO ] After 10239ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 08:35:00] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:35:06] [INFO ] After 6771ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 08:35:12] [INFO ] After 12544ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-12 08:35:13] [INFO ] After 23864ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 31 ms.
Support contains 45 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1325/1325 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 580/580 places, 1325/1325 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1325/1325 transitions.
Applied a total of 0 rules in 37 ms. Remains 580 /580 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
[2023-03-12 08:35:13] [INFO ] Invariant cache hit.
[2023-03-12 08:35:13] [INFO ] Implicit Places using invariants in 547 ms returned []
[2023-03-12 08:35:13] [INFO ] Invariant cache hit.
[2023-03-12 08:35:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-12 08:35:16] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 3003 ms to find 0 implicit places.
[2023-03-12 08:35:16] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-12 08:35:16] [INFO ] Invariant cache hit.
[2023-03-12 08:35:17] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3749 ms. Remains : 580/580 places, 1325/1325 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 580 transition count 1324
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 579 transition count 1324
Applied a total of 2 rules in 41 ms. Remains 579 /580 variables (removed 1) and now considering 1324/1325 (removed 1) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 1324 rows 579 cols
[2023-03-12 08:35:17] [INFO ] Computed 61 place invariants in 10 ms
[2023-03-12 08:35:17] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 08:35:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 38 ms returned sat
[2023-03-12 08:35:17] [INFO ] [Nat]Absence check using 14 positive and 47 generalized place invariants in 27 ms returned sat
[2023-03-12 08:35:42] [INFO ] After 25020ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 08:35:46] [INFO ] Deduced a trap composed of 37 places in 598 ms of which 3 ms to minimize.
[2023-03-12 08:35:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 706 ms
[2023-03-12 08:35:46] [INFO ] After 29272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9238 ms.
[2023-03-12 08:35:56] [INFO ] After 38876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-12 08:35:56] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 19 ms.
[2023-03-12 08:35:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 580 places, 1325 transitions and 5313 arcs took 10 ms.
[2023-03-12 08:35:56] [INFO ] Flatten gal took : 260 ms
Total runtime 250470 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/588/inv_0_ --invariant=/tmp/588/inv_1_ --invariant=/tmp/588/inv_2_ --invariant=/tmp/588/inv_3_ --invariant=/tmp/588/inv_4_ --invariant=/tmp/588/inv_5_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7681704 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098444 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-06a"
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-06a, 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-167813597400094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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