fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r021-smll-171620127800025
Last Updated
July 7, 2024

About the Execution of 2023-gold for ASLink-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
478.516 303721.00 355418.00 1060.30 FTFTFTFFTTTFTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r021-smll-171620127800025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ASLink-PT-02b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r021-smll-171620127800025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 856K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 11 18:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 18:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 417K May 18 16:42 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-02b-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-01
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-03
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-06
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2023-11
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716376943697

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=gold2023
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-22 11:22:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:22:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:22:26] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-05-22 11:22:26] [INFO ] Transformed 1242 places.
[2024-05-22 11:22:26] [INFO ] Transformed 1621 transitions.
[2024-05-22 11:22:26] [INFO ] Found NUPN structural information;
[2024-05-22 11:22:26] [INFO ] Parsed PT model containing 1242 places and 1621 transitions and 5041 arcs in 355 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 45 resets, run finished after 835 ms. (steps per millisecond=11 ) properties (out of 16) seen :5
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :1
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1621 rows 1242 cols
[2024-05-22 11:22:28] [INFO ] Computed 121 invariants in 96 ms
[2024-05-22 11:22:30] [INFO ] After 1083ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 11:22:31] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2024-05-22 11:22:31] [INFO ] [Nat]Absence check using 27 positive and 94 generalized place invariants in 75 ms returned sat
[2024-05-22 11:22:55] [INFO ] After 23676ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2024-05-22 11:22:55] [INFO ] After 23685ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :6
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 11:22:55] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :6
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 154 out of 1242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1242/1242 places, 1621/1621 transitions.
Drop transitions removed 214 transitions
Trivial Post-agglo rules discarded 214 transitions
Performed 214 trivial Post agglomeration. Transition count delta: 214
Iterating post reduction 0 with 214 rules applied. Total rules applied 214 place count 1242 transition count 1407
Reduce places removed 214 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 221 rules applied. Total rules applied 435 place count 1028 transition count 1400
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 18 rules applied. Total rules applied 453 place count 1027 transition count 1383
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 471 place count 1010 transition count 1382
Performed 232 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 232 Pre rules applied. Total rules applied 471 place count 1010 transition count 1150
Deduced a syphon composed of 232 places in 4 ms
Ensure Unique test removed 17 places
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 4 with 481 rules applied. Total rules applied 952 place count 761 transition count 1150
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 18 rules applied. Total rules applied 970 place count 756 transition count 1137
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 15 rules applied. Total rules applied 985 place count 743 transition count 1135
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 987 place count 741 transition count 1135
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 987 place count 741 transition count 1129
Deduced a syphon composed of 6 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 15 rules applied. Total rules applied 1002 place count 732 transition count 1129
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 1002 place count 732 transition count 1126
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1008 place count 729 transition count 1126
Discarding 33 places :
Symmetric choice reduction at 7 with 33 rule applications. Total rules 1041 place count 696 transition count 1093
Iterating global reduction 7 with 33 rules applied. Total rules applied 1074 place count 696 transition count 1093
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1075 place count 696 transition count 1092
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 10 Pre rules applied. Total rules applied 1075 place count 696 transition count 1082
Deduced a syphon composed of 10 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 21 rules applied. Total rules applied 1096 place count 685 transition count 1082
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1096 place count 685 transition count 1081
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1099 place count 683 transition count 1081
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1102 place count 680 transition count 1060
Iterating global reduction 8 with 3 rules applied. Total rules applied 1105 place count 680 transition count 1060
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 1105 place count 680 transition count 1058
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 1109 place count 678 transition count 1058
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 8 with 129 rules applied. Total rules applied 1238 place count 613 transition count 994
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1240 place count 612 transition count 1003
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1241 place count 612 transition count 1002
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1243 place count 612 transition count 1000
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1245 place count 610 transition count 1000
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1246 place count 610 transition count 999
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1247 place count 609 transition count 999
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1248 place count 609 transition count 999
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1249 place count 608 transition count 998
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 1251 place count 606 transition count 998
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 1251 place count 606 transition count 995
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 11 with 6 rules applied. Total rules applied 1257 place count 603 transition count 995
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 11 with 1 rules applied. Total rules applied 1258 place count 602 transition count 995
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 1262 place count 600 transition count 993
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1263 place count 600 transition count 992
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1264 place count 599 transition count 992
Applied a total of 1264 rules in 935 ms. Remains 599 /1242 variables (removed 643) and now considering 992/1621 (removed 629) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 938 ms. Remains : 599/1242 places, 992/1621 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 191926 steps, run timeout after 3002 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191926 steps, saw 51760 distinct states, run finished after 3006 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 992 rows 599 cols
[2024-05-22 11:23:00] [INFO ] Computed 90 invariants in 25 ms
[2024-05-22 11:23:00] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-22 11:23:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 16 ms returned sat
[2024-05-22 11:23:01] [INFO ] [Nat]Absence check using 21 positive and 69 generalized place invariants in 35 ms returned sat
[2024-05-22 11:23:25] [INFO ] After 24602ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-22 11:23:25] [INFO ] State equation strengthened by 1 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 11:23:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 11:23:25] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:9
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 153 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 992/992 transitions.
Applied a total of 0 rules in 23 ms. Remains 599 /599 variables (removed 0) and now considering 992/992 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 599/599 places, 992/992 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 214949 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214949 steps, saw 56615 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 8 properties.
[2024-05-22 11:23:29] [INFO ] Invariant cache hit.
[2024-05-22 11:23:30] [INFO ] [Real]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-22 11:23:30] [INFO ] [Real]Absence check using 21 positive and 69 generalized place invariants in 32 ms returned sat
[2024-05-22 11:23:30] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-05-22 11:23:30] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-22 11:23:30] [INFO ] [Nat]Absence check using 21 positive and 69 generalized place invariants in 31 ms returned sat
[2024-05-22 11:23:55] [INFO ] After 24650ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :4
[2024-05-22 11:23:55] [INFO ] State equation strengthened by 1 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 11:23:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 11:23:55] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 118 ms.
Support contains 150 out of 599 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 599/599 places, 992/992 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 599 transition count 991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 598 transition count 991
Applied a total of 2 rules in 29 ms. Remains 598 /599 variables (removed 1) and now considering 991/992 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 598/599 places, 991/992 transitions.
Incomplete random walk after 10000 steps, including 83 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 219448 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219448 steps, saw 57655 distinct states, run finished after 3002 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 991 rows 598 cols
[2024-05-22 11:23:59] [INFO ] Computed 90 invariants in 21 ms
[2024-05-22 11:23:59] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-22 11:23:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2024-05-22 11:23:59] [INFO ] [Nat]Absence check using 21 positive and 69 generalized place invariants in 33 ms returned sat
[2024-05-22 11:24:24] [INFO ] After 24700ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 11:24:24] [INFO ] State equation strengthened by 1 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 11:24:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 11:24:24] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 79 ms.
Support contains 150 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 991/991 transitions.
Applied a total of 0 rules in 21 ms. Remains 598 /598 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 598/598 places, 991/991 transitions.
Incomplete random walk after 10000 steps, including 78 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 239119 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239119 steps, saw 63776 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 11:24:28] [INFO ] Invariant cache hit.
[2024-05-22 11:24:28] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 11:24:28] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2024-05-22 11:24:28] [INFO ] [Nat]Absence check using 21 positive and 69 generalized place invariants in 31 ms returned sat
[2024-05-22 11:24:53] [INFO ] After 24736ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:24:53] [INFO ] State equation strengthened by 1 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:645)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:353)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:226)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:96)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:944)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
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)
[2024-05-22 11:24:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2024-05-22 11:24:53] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 150 out of 598 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 991/991 transitions.
Applied a total of 0 rules in 25 ms. Remains 598 /598 variables (removed 0) and now considering 991/991 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 598/598 places, 991/991 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 598/598 places, 991/991 transitions.
Applied a total of 0 rules in 28 ms. Remains 598 /598 variables (removed 0) and now considering 991/991 (removed 0) transitions.
[2024-05-22 11:24:53] [INFO ] Invariant cache hit.
[2024-05-22 11:24:54] [INFO ] Implicit Places using invariants in 547 ms returned [28, 51, 73, 92, 173, 184, 196, 212, 219, 241, 261, 312, 368, 373, 376, 391, 392, 393, 394, 449, 470, 475, 476, 493, 499, 506, 512, 518, 524, 531, 538, 545, 552]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 552 ms to find 33 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 565/598 places, 991/991 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 565 transition count 980
Reduce places removed 11 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 31 rules applied. Total rules applied 42 place count 554 transition count 960
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 62 place count 534 transition count 960
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 62 place count 534 transition count 954
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 74 place count 528 transition count 954
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 82 place count 520 transition count 946
Iterating global reduction 3 with 8 rules applied. Total rules applied 90 place count 520 transition count 946
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 517 transition count 943
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 517 transition count 943
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 516 transition count 941
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 516 transition count 941
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 134 place count 498 transition count 923
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 497 transition count 922
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 497 transition count 922
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 496 transition count 921
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 496 transition count 921
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 139 place count 496 transition count 920
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 496 transition count 919
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 495 transition count 919
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 144 place count 495 transition count 916
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 147 place count 492 transition count 916
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 149 place count 492 transition count 916
Applied a total of 149 rules in 146 ms. Remains 492 /565 variables (removed 73) and now considering 916/991 (removed 75) transitions.
// Phase 1: matrix 916 rows 492 cols
[2024-05-22 11:24:54] [INFO ] Computed 57 invariants in 9 ms
[2024-05-22 11:24:54] [INFO ] Implicit Places using invariants in 506 ms returned [159, 170, 259, 286, 462]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 510 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/598 places, 916/991 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 485 transition count 914
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 485 transition count 914
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 484 transition count 913
Applied a total of 6 rules in 29 ms. Remains 484 /487 variables (removed 3) and now considering 913/916 (removed 3) transitions.
// Phase 1: matrix 913 rows 484 cols
[2024-05-22 11:24:54] [INFO ] Computed 52 invariants in 9 ms
[2024-05-22 11:24:55] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-22 11:24:55] [INFO ] Invariant cache hit.
[2024-05-22 11:24:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 11:24:56] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 484/598 places, 913/991 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3091 ms. Remains : 484/598 places, 913/991 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 28 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 30 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 193975 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193975 steps, saw 86539 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-22 11:25:00] [INFO ] Invariant cache hit.
[2024-05-22 11:25:00] [INFO ] After 135ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-22 11:25:00] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-22 11:25:00] [INFO ] [Nat]Absence check using 12 positive and 40 generalized place invariants in 23 ms returned sat
[2024-05-22 11:25:13] [INFO ] After 12468ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-22 11:25:13] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 11:25:19] [INFO ] After 6481ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-22 11:25:25] [INFO ] After 12315ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2024-05-22 11:25:25] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-02b-ReachabilityFireability-2024-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 131 ms.
Support contains 118 out of 484 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 484/484 places, 913/913 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 484 transition count 908
Reduce places removed 6 places and 0 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 1 with 7 rules applied. Total rules applied 12 place count 478 transition count 907
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 477 transition count 904
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 20 place count 474 transition count 903
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 20 place count 474 transition count 888
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 50 place count 459 transition count 888
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 51 place count 458 transition count 887
Iterating global reduction 4 with 1 rules applied. Total rules applied 52 place count 458 transition count 887
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 53 place count 457 transition count 886
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 457 transition count 886
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 70 place count 449 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 449 transition count 877
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 72 place count 448 transition count 875
Iterating global reduction 5 with 1 rules applied. Total rules applied 73 place count 448 transition count 875
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 75 place count 448 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 77 place count 446 transition count 873
Applied a total of 77 rules in 70 ms. Remains 446 /484 variables (removed 38) and now considering 873/913 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 446/484 places, 873/913 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 320133 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :{}
Probabilistic random walk after 320133 steps, saw 101167 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 873 rows 446 cols
[2024-05-22 11:25:29] [INFO ] Computed 51 invariants in 8 ms
[2024-05-22 11:25:29] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 11:25:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-22 11:25:29] [INFO ] [Nat]Absence check using 13 positive and 38 generalized place invariants in 19 ms returned sat
[2024-05-22 11:25:39] [INFO ] After 10399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:25:39] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:25:45] [INFO ] After 5398ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:25:54] [INFO ] After 14439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2024-05-22 11:25:54] [INFO ] After 25008ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 136 ms.
Support contains 118 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 873/873 transitions.
Applied a total of 0 rules in 11 ms. Remains 446 /446 variables (removed 0) and now considering 873/873 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 446/446 places, 873/873 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 873/873 transitions.
Applied a total of 0 rules in 11 ms. Remains 446 /446 variables (removed 0) and now considering 873/873 (removed 0) transitions.
[2024-05-22 11:25:54] [INFO ] Invariant cache hit.
[2024-05-22 11:25:54] [INFO ] Implicit Places using invariants in 335 ms returned [103, 153, 302, 342, 344]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 350 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 441/446 places, 873/873 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 441 transition count 869
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 437 transition count 869
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 34 place count 424 transition count 856
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 423 transition count 857
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 423 transition count 851
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 48 place count 417 transition count 851
Applied a total of 48 rules in 47 ms. Remains 417 /441 variables (removed 24) and now considering 851/873 (removed 22) transitions.
// Phase 1: matrix 851 rows 417 cols
[2024-05-22 11:25:54] [INFO ] Computed 46 invariants in 8 ms
[2024-05-22 11:25:55] [INFO ] Implicit Places using invariants in 300 ms returned [401, 404, 407, 413, 416]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 316 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 412/446 places, 851/873 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 409 transition count 848
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 409 transition count 848
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 406 transition count 845
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 406 transition count 845
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 406 transition count 842
Applied a total of 15 rules in 25 ms. Remains 406 /412 variables (removed 6) and now considering 842/851 (removed 9) transitions.
// Phase 1: matrix 842 rows 406 cols
[2024-05-22 11:25:55] [INFO ] Computed 41 invariants in 7 ms
[2024-05-22 11:25:55] [INFO ] Implicit Places using invariants in 289 ms returned []
[2024-05-22 11:25:55] [INFO ] Invariant cache hit.
[2024-05-22 11:25:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 11:25:56] [INFO ] Implicit Places using invariants and state equation in 1301 ms returned []
Implicit Place search using SMT with State Equation took 1601 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 406/446 places, 842/873 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2352 ms. Remains : 406/446 places, 842/873 transitions.
Incomplete random walk after 10000 steps, including 100 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 351237 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :{}
Probabilistic random walk after 351237 steps, saw 98992 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-22 11:26:00] [INFO ] Invariant cache hit.
[2024-05-22 11:26:00] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 11:26:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-05-22 11:26:00] [INFO ] [Nat]Absence check using 9 positive and 32 generalized place invariants in 17 ms returned sat
[2024-05-22 11:26:08] [INFO ] After 8371ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-05-22 11:26:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 11:26:12] [INFO ] After 3745ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2024-05-22 11:26:25] [INFO ] After 16470ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2024-05-22 11:26:25] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
FORMULA ASLink-PT-02b-ReachabilityFireability-2023-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 50 out of 406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 406/406 places, 842/842 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 406 transition count 833
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 397 transition count 831
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 26 place count 396 transition count 826
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 31 place count 391 transition count 826
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 31 place count 391 transition count 790
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 105 place count 353 transition count 790
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 351 transition count 790
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 109 place count 349 transition count 788
Iterating global reduction 5 with 2 rules applied. Total rules applied 111 place count 349 transition count 788
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 129 place count 340 transition count 779
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 131 place count 340 transition count 777
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 134 place count 338 transition count 776
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 140 place count 338 transition count 770
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 146 place count 332 transition count 770
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 148 place count 330 transition count 768
Applied a total of 148 rules in 109 ms. Remains 330 /406 variables (removed 76) and now considering 768/842 (removed 74) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 330/406 places, 768/842 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 269605 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269605 steps, saw 148789 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 768 rows 330 cols
[2024-05-22 11:26:28] [INFO ] Computed 37 invariants in 8 ms
[2024-05-22 11:26:28] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:26:28] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-22 11:26:28] [INFO ] [Nat]Absence check using 11 positive and 26 generalized place invariants in 11 ms returned sat
[2024-05-22 11:26:37] [INFO ] After 8579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:26:43] [INFO ] Deduced a trap composed of 39 places in 182 ms of which 6 ms to minimize.
[2024-05-22 11:26:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 367 ms
[2024-05-22 11:26:43] [INFO ] After 14494ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 943 ms.
[2024-05-22 11:26:44] [INFO ] After 15545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 167 ms.
Support contains 50 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 768/768 transitions.
Applied a total of 0 rules in 17 ms. Remains 330 /330 variables (removed 0) and now considering 768/768 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 330/330 places, 768/768 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 768/768 transitions.
Applied a total of 0 rules in 11 ms. Remains 330 /330 variables (removed 0) and now considering 768/768 (removed 0) transitions.
[2024-05-22 11:26:44] [INFO ] Invariant cache hit.
[2024-05-22 11:26:44] [INFO ] Implicit Places using invariants in 427 ms returned [3, 99, 113, 119, 135, 226, 227]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 429 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 323/330 places, 768/768 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 323 transition count 766
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 321 transition count 765
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 320 transition count 765
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 319 transition count 764
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 319 transition count 764
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 314 transition count 759
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 313 transition count 758
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 313 transition count 758
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 23 place count 313 transition count 755
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 26 place count 310 transition count 755
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 30 place count 310 transition count 751
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 34 place count 306 transition count 751
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 35 place count 306 transition count 750
Applied a total of 35 rules in 111 ms. Remains 306 /323 variables (removed 17) and now considering 750/768 (removed 18) transitions.
// Phase 1: matrix 750 rows 306 cols
[2024-05-22 11:26:44] [INFO ] Computed 30 invariants in 7 ms
[2024-05-22 11:26:45] [INFO ] Implicit Places using invariants in 371 ms returned [115, 116]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 373 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 304/330 places, 750/768 transitions.
Applied a total of 0 rules in 14 ms. Remains 304 /304 variables (removed 0) and now considering 750/750 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 944 ms. Remains : 304/330 places, 750/768 transitions.
Incomplete random walk after 10000 steps, including 168 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 222177 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222177 steps, saw 127458 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 750 rows 304 cols
[2024-05-22 11:26:48] [INFO ] Computed 28 invariants in 7 ms
[2024-05-22 11:26:48] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:26:48] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2024-05-22 11:26:48] [INFO ] [Nat]Absence check using 10 positive and 18 generalized place invariants in 13 ms returned sat
[2024-05-22 11:27:00] [INFO ] After 11998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 11:27:07] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 2 ms to minimize.
[2024-05-22 11:27:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 997 ms
[2024-05-22 11:27:08] [INFO ] After 19385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 159 ms.
[2024-05-22 11:27:08] [INFO ] After 19656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 50 out of 304 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 750/750 transitions.
Applied a total of 0 rules in 11 ms. Remains 304 /304 variables (removed 0) and now considering 750/750 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 304/304 places, 750/750 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 304/304 places, 750/750 transitions.
Applied a total of 0 rules in 10 ms. Remains 304 /304 variables (removed 0) and now considering 750/750 (removed 0) transitions.
[2024-05-22 11:27:08] [INFO ] Invariant cache hit.
[2024-05-22 11:27:08] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 11:27:08] [INFO ] Invariant cache hit.
[2024-05-22 11:27:09] [INFO ] Implicit Places using invariants and state equation in 1149 ms returned []
Implicit Place search using SMT with State Equation took 1407 ms to find 0 implicit places.
[2024-05-22 11:27:09] [INFO ] Redundant transitions in 53 ms returned []
[2024-05-22 11:27:09] [INFO ] Invariant cache hit.
[2024-05-22 11:27:10] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2088 ms. Remains : 304/304 places, 750/750 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 304 transition count 749
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 303 transition count 749
Applied a total of 2 rules in 12 ms. Remains 303 /304 variables (removed 1) and now considering 749/750 (removed 1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 749 rows 303 cols
[2024-05-22 11:27:10] [INFO ] Computed 28 invariants in 6 ms
[2024-05-22 11:27:10] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 11:27:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-22 11:27:10] [INFO ] [Nat]Absence check using 10 positive and 18 generalized place invariants in 19 ms returned sat
[2024-05-22 11:27:17] [INFO ] After 6386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 11:27:23] [INFO ] Deduced a trap composed of 38 places in 167 ms of which 3 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Deduced a trap composed of 24 places in 206 ms of which 1 ms to minimize.
[2024-05-22 11:27:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1741 ms
[2024-05-22 11:27:24] [INFO ] After 14321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 443 ms.
[2024-05-22 11:27:25] [INFO ] After 14906ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-22 11:27:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2024-05-22 11:27:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 304 places, 750 transitions and 2944 arcs took 7 ms.
[2024-05-22 11:27:25] [INFO ] Flatten gal took : 145 ms
Total runtime 299664 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-02b
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityFireability

FORMULA ASLink-PT-02b-ReachabilityFireability-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ASLink-PT-02b-ReachabilityFireability-2024-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716377247418

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 ASLink-PT-02b-ReachabilityFireability-2024-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ASLink-PT-02b-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ASLink-PT-02b-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 0 ASLink-PT-02b-ReachabilityFireability-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/371/ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 6 (type FNDP) for ASLink-PT-02b-ReachabilityFireability-2024-05
lola: result : true
lola: fired transitions : 13516
lola: tried executions : 235
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for ASLink-PT-02b-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ASLink-PT-02b-ReachabilityFireability-2024-05 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ASLink-PT-02b-ReachabilityFireability-2024-05 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 ASLink-PT-02b-ReachabilityFireability-2024-13
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 ASLink-PT-02b-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ASLink-PT-02b-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 15 (type SRCH) for 3 ASLink-PT-02b-ReachabilityFireability-2024-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 7 (type EQUN) for ASLink-PT-02b-ReachabilityFireability-2024-05
lola: result : unknown
lola: FINISHED task # 12 (type FNDP) for ASLink-PT-02b-ReachabilityFireability-2024-13
lola: result : true
lola: fired transitions : 143
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for ASLink-PT-02b-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 15 (type SRCH) for ASLink-PT-02b-ReachabilityFireability-2024-13 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ASLink-PT-02b-ReachabilityFireability-2024-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-02b-ReachabilityFireability-2024-05: EF true findpath
ASLink-PT-02b-ReachabilityFireability-2024-13: EF true findpath


Time elapsed: 1 secs. Pages in use: 2

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-02b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ASLink-PT-02b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r021-smll-171620127800025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-02b.tgz
mv ASLink-PT-02b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;