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

About the Execution of Marcie+red for ASLink-PT-07b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9496.915 3600000.00 3708866.00 180.30 ?TTFT?FFT??FF?TT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813598600119.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 marciexred
Input is ASLink-PT-07b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598600119
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Feb 26 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 13:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 13:06 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 1.1M 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-07b-ReachabilityFireability-00
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-01
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-02
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-03
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-04
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-05
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-06
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-07
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-08
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-09
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-10
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-11
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-12
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-13
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-14
FORMULA_NAME ASLink-PT-07b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678667246925

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=marciexred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-07b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 00:27:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 00:27:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 00:27:30] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2023-03-13 00:27:30] [INFO ] Transformed 3222 places.
[2023-03-13 00:27:30] [INFO ] Transformed 3986 transitions.
[2023-03-13 00:27:30] [INFO ] Found NUPN structural information;
[2023-03-13 00:27:30] [INFO ] Parsed PT model containing 3222 places and 3986 transitions and 12126 arcs in 439 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 426 ms. (steps per millisecond=23 ) properties (out of 16) seen :5
FORMULA ASLink-PT-07b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 3986 rows 3222 cols
[2023-03-13 00:27:31] [INFO ] Computed 316 place invariants in 148 ms
[2023-03-13 00:27:33] [INFO ] After 1820ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-13 00:27:35] [INFO ] [Nat]Absence check using 75 positive place invariants in 79 ms returned sat
[2023-03-13 00:27:35] [INFO ] [Nat]Absence check using 75 positive and 241 generalized place invariants in 242 ms returned sat
[2023-03-13 00:27:58] [INFO ] After 22336ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-13 00:27:58] [INFO ] After 22350ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 00:27:58] [INFO ] After 25071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 249 out of 3222 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3222/3222 places, 3986/3986 transitions.
Drop transitions removed 638 transitions
Trivial Post-agglo rules discarded 638 transitions
Performed 638 trivial Post agglomeration. Transition count delta: 638
Iterating post reduction 0 with 638 rules applied. Total rules applied 638 place count 3222 transition count 3348
Reduce places removed 638 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 660 rules applied. Total rules applied 1298 place count 2584 transition count 3326
Reduce places removed 6 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 40 rules applied. Total rules applied 1338 place count 2578 transition count 3292
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 44 rules applied. Total rules applied 1382 place count 2544 transition count 3282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1384 place count 2542 transition count 3282
Performed 663 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 663 Pre rules applied. Total rules applied 1384 place count 2542 transition count 2619
Deduced a syphon composed of 663 places in 8 ms
Ensure Unique test removed 56 places
Reduce places removed 719 places and 0 transitions.
Iterating global reduction 5 with 1382 rules applied. Total rules applied 2766 place count 1823 transition count 2619
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 5 with 46 rules applied. Total rules applied 2812 place count 1809 transition count 2587
Reduce places removed 32 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 6 with 42 rules applied. Total rules applied 2854 place count 1777 transition count 2577
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 2864 place count 1767 transition count 2577
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 2864 place count 1767 transition count 2559
Deduced a syphon composed of 18 places in 6 ms
Ensure Unique test removed 16 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 2916 place count 1733 transition count 2559
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 16 Pre rules applied. Total rules applied 2916 place count 1733 transition count 2543
Deduced a syphon composed of 16 places in 16 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2948 place count 1717 transition count 2543
Discarding 93 places :
Symmetric choice reduction at 8 with 93 rule applications. Total rules 3041 place count 1624 transition count 2450
Iterating global reduction 8 with 93 rules applied. Total rules applied 3134 place count 1624 transition count 2450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3135 place count 1624 transition count 2449
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 24 Pre rules applied. Total rules applied 3135 place count 1624 transition count 2425
Deduced a syphon composed of 24 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 9 with 49 rules applied. Total rules applied 3184 place count 1599 transition count 2425
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 3184 place count 1599 transition count 2424
Deduced a syphon composed of 1 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 3187 place count 1597 transition count 2424
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3189 place count 1595 transition count 2412
Iterating global reduction 9 with 2 rules applied. Total rules applied 3191 place count 1595 transition count 2412
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 3191 place count 1595 transition count 2410
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3195 place count 1593 transition count 2410
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 6 ms
Ensure Unique test removed 3 places
Reduce places removed 176 places and 0 transitions.
Iterating global reduction 9 with 349 rules applied. Total rules applied 3544 place count 1417 transition count 2237
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 3545 place count 1417 transition count 2236
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 3547 place count 1416 transition count 2235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3548 place count 1415 transition count 2235
Free-agglomeration rule applied 10 times.
Iterating global reduction 11 with 10 rules applied. Total rules applied 3558 place count 1415 transition count 2225
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 3568 place count 1405 transition count 2225
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 12 with 8 rules applied. Total rules applied 3576 place count 1405 transition count 2217
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 12 with 8 rules applied. Total rules applied 3584 place count 1397 transition count 2217
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 3585 place count 1397 transition count 2217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3586 place count 1396 transition count 2216
Reduce places removed 4 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 13 with 5 rules applied. Total rules applied 3591 place count 1392 transition count 2215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 3592 place count 1391 transition count 2215
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 6 Pre rules applied. Total rules applied 3592 place count 1391 transition count 2209
Deduced a syphon composed of 6 places in 5 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 3604 place count 1385 transition count 2209
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 15 with 2 rules applied. Total rules applied 3606 place count 1383 transition count 2209
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 16 with 8 rules applied. Total rules applied 3614 place count 1379 transition count 2205
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3615 place count 1378 transition count 2204
Iterating global reduction 16 with 1 rules applied. Total rules applied 3616 place count 1378 transition count 2204
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 3617 place count 1377 transition count 2203
Iterating global reduction 16 with 1 rules applied. Total rules applied 3618 place count 1377 transition count 2203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 3619 place count 1377 transition count 2202
Applied a total of 3619 rules in 1444 ms. Remains 1377 /3222 variables (removed 1845) and now considering 2202/3986 (removed 1784) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1445 ms. Remains : 1377/3222 places, 2202/3986 transitions.
Incomplete random walk after 10000 steps, including 46 resets, run finished after 453 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 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 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 11) seen :0
Interrupted probabilistic random walk after 104401 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{4=1}
Probabilistic random walk after 104401 steps, saw 45394 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 2202 rows 1377 cols
[2023-03-13 00:28:04] [INFO ] Computed 218 place invariants in 73 ms
[2023-03-13 00:28:05] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 00:28:05] [INFO ] [Nat]Absence check using 52 positive place invariants in 39 ms returned sat
[2023-03-13 00:28:05] [INFO ] [Nat]Absence check using 52 positive and 166 generalized place invariants in 131 ms returned sat
[2023-03-13 00:28:30] [INFO ] After 23990ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 00:28:30] [INFO ] State equation strengthened by 17 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-13 00:28:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:28:30] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 393 ms.
Support contains 248 out of 1377 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1377/1377 places, 2202/2202 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 1377 transition count 2201
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1376 transition count 2201
Applied a total of 2 rules in 61 ms. Remains 1376 /1377 variables (removed 1) and now considering 2201/2202 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 1376/1377 places, 2201/2202 transitions.
Incomplete random walk after 10000 steps, including 59 resets, run finished after 385 ms. (steps per millisecond=25 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 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 8 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 101375 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101375 steps, saw 43970 distinct states, run finished after 3002 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 2201 rows 1376 cols
[2023-03-13 00:28:34] [INFO ] Computed 218 place invariants in 19 ms
[2023-03-13 00:28:35] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-13 00:28:35] [INFO ] [Nat]Absence check using 53 positive place invariants in 28 ms returned sat
[2023-03-13 00:28:36] [INFO ] [Nat]Absence check using 53 positive and 165 generalized place invariants in 97 ms returned sat
[2023-03-13 00:29:00] [INFO ] After 23906ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 00:29:00] [INFO ] State equation strengthened by 17 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-13 00:29:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:29:00] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 828 ms.
Support contains 248 out of 1376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1376/1376 places, 2201/2201 transitions.
Applied a total of 0 rules in 44 ms. Remains 1376 /1376 variables (removed 0) and now considering 2201/2201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1376/1376 places, 2201/2201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1376/1376 places, 2201/2201 transitions.
Applied a total of 0 rules in 47 ms. Remains 1376 /1376 variables (removed 0) and now considering 2201/2201 (removed 0) transitions.
[2023-03-13 00:29:01] [INFO ] Invariant cache hit.
[2023-03-13 00:29:02] [INFO ] Implicit Places using invariants in 1015 ms returned [3, 25, 28, 33, 47, 87, 162, 182, 195, 198, 199, 224, 244, 365, 366, 367, 390, 408, 431, 453, 486, 489, 505, 512, 527, 528, 575, 621, 625, 642, 675, 694, 695, 726, 745, 850, 852, 987, 990, 1003, 1016, 1021, 1025, 1048, 1067, 1110, 1156, 1161, 1164, 1179, 1182, 1183, 1232, 1237, 1259, 1262, 1263, 1277, 1283, 1289, 1295, 1301, 1307, 1314, 1320, 1326, 1332, 1338]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 68 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1308/1376 places, 2201/2201 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 1308 transition count 2154
Reduce places removed 47 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 71 rules applied. Total rules applied 118 place count 1261 transition count 2130
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 142 place count 1237 transition count 2130
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 142 place count 1237 transition count 2102
Deduced a syphon composed of 28 places in 4 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 198 place count 1209 transition count 2102
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 203 place count 1206 transition count 2100
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 206 place count 1204 transition count 2099
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 207 place count 1203 transition count 2099
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 217 place count 1193 transition count 2089
Iterating global reduction 6 with 10 rules applied. Total rules applied 227 place count 1193 transition count 2089
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 229 place count 1191 transition count 2087
Iterating global reduction 6 with 2 rules applied. Total rules applied 231 place count 1191 transition count 2087
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 1191 transition count 2086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 233 place count 1190 transition count 2085
Iterating global reduction 7 with 1 rules applied. Total rules applied 234 place count 1190 transition count 2085
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 4 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 7 with 88 rules applied. Total rules applied 322 place count 1146 transition count 2041
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 324 place count 1144 transition count 2038
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 1144 transition count 2038
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 327 place count 1144 transition count 2037
Free-agglomeration rule applied 3 times.
Iterating global reduction 8 with 3 rules applied. Total rules applied 330 place count 1144 transition count 2034
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 333 place count 1141 transition count 2034
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 9 with 10 rules applied. Total rules applied 343 place count 1141 transition count 2024
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 9 with 10 rules applied. Total rules applied 353 place count 1131 transition count 2024
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 10 with 8 rules applied. Total rules applied 361 place count 1131 transition count 2024
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 363 place count 1131 transition count 2024
Applied a total of 363 rules in 525 ms. Remains 1131 /1308 variables (removed 177) and now considering 2024/2201 (removed 177) transitions.
// Phase 1: matrix 2024 rows 1131 cols
[2023-03-13 00:29:02] [INFO ] Computed 147 place invariants in 43 ms
[2023-03-13 00:29:03] [INFO ] Implicit Places using invariants in 684 ms returned [125, 141, 144, 224, 249, 255, 280, 403, 539, 549, 683, 689, 698, 932, 951, 967, 1104, 1122]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 690 ms to find 18 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1113/1376 places, 2024/2201 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1107 transition count 2018
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1107 transition count 2018
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 1105 transition count 2016
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 1105 transition count 2016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1104 transition count 2015
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1104 transition count 2015
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 32 place count 1097 transition count 2008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1096 transition count 2006
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1096 transition count 2006
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 41 place count 1096 transition count 1999
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 48 place count 1089 transition count 1999
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 1089 transition count 1997
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 1087 transition count 1997
Applied a total of 52 rules in 250 ms. Remains 1087 /1113 variables (removed 26) and now considering 1997/2024 (removed 27) transitions.
// Phase 1: matrix 1997 rows 1087 cols
[2023-03-13 00:29:03] [INFO ] Computed 129 place invariants in 26 ms
[2023-03-13 00:29:04] [INFO ] Implicit Places using invariants in 536 ms returned []
[2023-03-13 00:29:04] [INFO ] Invariant cache hit.
[2023-03-13 00:29:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-13 00:29:07] [INFO ] Implicit Places using invariants and state equation in 3174 ms returned []
Implicit Place search using SMT with State Equation took 3722 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 1087/1376 places, 1997/2201 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6256 ms. Remains : 1087/1376 places, 1997/2201 transitions.
Incomplete random walk after 10000 steps, including 58 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 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 10 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :1
FORMULA ASLink-PT-07b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 00:29:08] [INFO ] Invariant cache hit.
[2023-03-13 00:29:08] [INFO ] After 274ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:29:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2023-03-13 00:29:09] [INFO ] [Nat]Absence check using 33 positive and 96 generalized place invariants in 174 ms returned sat
[2023-03-13 00:29:33] [INFO ] After 24385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:29:33] [INFO ] State equation strengthened by 3 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-13 00:29:33] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 00:29:33] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1042 ms.
Support contains 97 out of 1087 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1087/1087 places, 1997/1997 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1087 transition count 1970
Reduce places removed 27 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 1060 transition count 1966
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 62 place count 1056 transition count 1966
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 62 place count 1056 transition count 1897
Deduced a syphon composed of 69 places in 2 ms
Ensure Unique test removed 4 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 204 place count 983 transition count 1897
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 212 place count 975 transition count 1880
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 975 transition count 1880
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 220 place count 975 transition count 1878
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 224 place count 973 transition count 1878
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 283 place count 943 transition count 1849
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 284 place count 943 transition count 1848
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 284 place count 943 transition count 1843
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 294 place count 938 transition count 1843
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 298 place count 934 transition count 1835
Iterating global reduction 4 with 4 rules applied. Total rules applied 302 place count 934 transition count 1835
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 305 place count 931 transition count 1832
Iterating global reduction 4 with 3 rules applied. Total rules applied 308 place count 931 transition count 1832
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 309 place count 930 transition count 1831
Iterating global reduction 4 with 1 rules applied. Total rules applied 310 place count 930 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 311 place count 929 transition count 1830
Iterating global reduction 4 with 1 rules applied. Total rules applied 312 place count 929 transition count 1830
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 316 place count 927 transition count 1834
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 321 place count 927 transition count 1829
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 326 place count 922 transition count 1829
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 329 place count 922 transition count 1826
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 332 place count 919 transition count 1826
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 334 place count 919 transition count 1826
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 339 place count 914 transition count 1821
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 341 place count 912 transition count 1821
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 341 place count 912 transition count 1819
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 345 place count 910 transition count 1819
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 1 rules applied. Total rules applied 346 place count 909 transition count 1819
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 352 place count 906 transition count 1816
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 353 place count 905 transition count 1815
Iterating global reduction 8 with 1 rules applied. Total rules applied 354 place count 905 transition count 1815
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 355 place count 905 transition count 1814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 356 place count 904 transition count 1814
Applied a total of 356 rules in 437 ms. Remains 904 /1087 variables (removed 183) and now considering 1814/1997 (removed 183) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 437 ms. Remains : 904/1087 places, 1814/1997 transitions.
Incomplete random walk after 10000 steps, including 88 resets, run finished after 310 ms. (steps per millisecond=32 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 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 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 245050 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245050 steps, saw 47364 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1814 rows 904 cols
[2023-03-13 00:29:39] [INFO ] Computed 121 place invariants in 17 ms
[2023-03-13 00:29:39] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 00:29:39] [INFO ] [Nat]Absence check using 21 positive place invariants in 21 ms returned sat
[2023-03-13 00:29:39] [INFO ] [Nat]Absence check using 21 positive and 100 generalized place invariants in 45 ms returned sat
[2023-03-13 00:30:01] [INFO ] After 21175ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-13 00:30:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:30:04] [INFO ] After 3372ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :2 sat :4
[2023-03-13 00:30:04] [INFO ] After 3373ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-13 00:30:04] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :4
FORMULA ASLink-PT-07b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ASLink-PT-07b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 265 ms.
Support contains 68 out of 904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 904/904 places, 1814/1814 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 904 transition count 1812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 902 transition count 1812
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 4 place count 902 transition count 1797
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 34 place count 887 transition count 1797
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 881 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 880 transition count 1785
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 880 transition count 1785
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 879 transition count 1785
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 878 transition count 1784
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 877 transition count 1783
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 877 transition count 1783
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 877 transition count 1782
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 56 place count 876 transition count 1781
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 57 place count 876 transition count 1780
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 58 place count 875 transition count 1780
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 875 transition count 1780
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 61 place count 873 transition count 1778
Applied a total of 61 rules in 253 ms. Remains 873 /904 variables (removed 31) and now considering 1778/1814 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 253 ms. Remains : 873/904 places, 1778/1814 transitions.
Incomplete random walk after 10000 steps, including 93 resets, run finished after 262 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 248994 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248994 steps, saw 52995 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1778 rows 873 cols
[2023-03-13 00:30:08] [INFO ] Computed 120 place invariants in 19 ms
[2023-03-13 00:30:08] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-13 00:30:08] [INFO ] [Nat]Absence check using 25 positive place invariants in 6 ms returned sat
[2023-03-13 00:30:08] [INFO ] [Nat]Absence check using 25 positive and 95 generalized place invariants in 36 ms returned sat
[2023-03-13 00:30:17] [INFO ] After 8304ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-13 00:30:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:30:19] [INFO ] After 1573ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-13 00:30:22] [INFO ] Deduced a trap composed of 25 places in 2103 ms of which 20 ms to minimize.
[2023-03-13 00:30:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2300 ms
[2023-03-13 00:30:23] [INFO ] After 5629ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2459 ms.
[2023-03-13 00:30:25] [INFO ] After 16720ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ASLink-PT-07b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 315 ms.
Support contains 64 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1778/1778 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 873 transition count 1774
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 869 transition count 1774
Applied a total of 8 rules in 57 ms. Remains 869 /873 variables (removed 4) and now considering 1774/1778 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 869/873 places, 1774/1778 transitions.
Incomplete random walk after 10000 steps, including 98 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 246209 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 246209 steps, saw 52193 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1774 rows 869 cols
[2023-03-13 00:30:29] [INFO ] Computed 120 place invariants in 16 ms
[2023-03-13 00:30:29] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:30:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-13 00:30:29] [INFO ] [Nat]Absence check using 23 positive and 97 generalized place invariants in 72 ms returned sat
[2023-03-13 00:30:32] [INFO ] After 2149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:30:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 00:30:33] [INFO ] After 1594ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 00:30:36] [INFO ] Deduced a trap composed of 25 places in 371 ms of which 13 ms to minimize.
[2023-03-13 00:30:37] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 14 ms to minimize.
[2023-03-13 00:30:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 774 ms
[2023-03-13 00:30:37] [INFO ] Deduced a trap composed of 40 places in 502 ms of which 3 ms to minimize.
[2023-03-13 00:30:38] [INFO ] Deduced a trap composed of 37 places in 193 ms of which 0 ms to minimize.
[2023-03-13 00:30:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 951 ms
[2023-03-13 00:30:38] [INFO ] After 6698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 945 ms.
[2023-03-13 00:30:39] [INFO ] After 10314ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 233 ms.
Support contains 64 out of 869 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1774/1774 transitions.
Applied a total of 0 rules in 24 ms. Remains 869 /869 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 869/869 places, 1774/1774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 869/869 places, 1774/1774 transitions.
Applied a total of 0 rules in 22 ms. Remains 869 /869 variables (removed 0) and now considering 1774/1774 (removed 0) transitions.
[2023-03-13 00:30:40] [INFO ] Invariant cache hit.
[2023-03-13 00:30:40] [INFO ] Implicit Places using invariants in 669 ms returned [44, 107, 125, 214, 229, 304, 310, 321, 322, 324, 342, 408, 434, 537, 538, 539, 540, 561, 579, 629, 637, 643, 644, 741, 744, 759, 795]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 675 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 842/869 places, 1774/1774 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 842 transition count 1743
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 64 place count 811 transition count 1741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 810 transition count 1741
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 65 place count 810 transition count 1737
Deduced a syphon composed of 4 places in 6 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 73 place count 806 transition count 1737
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 802 transition count 1733
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 802 transition count 1733
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 83 place count 800 transition count 1731
Iterating global reduction 3 with 2 rules applied. Total rules applied 85 place count 800 transition count 1731
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 3 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 155 place count 765 transition count 1696
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 159 place count 761 transition count 1691
Iterating global reduction 3 with 4 rules applied. Total rules applied 163 place count 761 transition count 1691
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 165 place count 759 transition count 1689
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 759 transition count 1689
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 3 with 4 rules applied. Total rules applied 171 place count 757 transition count 1691
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 179 place count 757 transition count 1683
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 187 place count 749 transition count 1683
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 196 place count 749 transition count 1674
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 205 place count 740 transition count 1674
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 206 place count 740 transition count 1673
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 209 place count 740 transition count 1673
Applied a total of 209 rules in 224 ms. Remains 740 /842 variables (removed 102) and now considering 1673/1774 (removed 101) transitions.
// Phase 1: matrix 1673 rows 740 cols
[2023-03-13 00:30:41] [INFO ] Computed 93 place invariants in 34 ms
[2023-03-13 00:30:41] [INFO ] Implicit Places using invariants in 713 ms returned [105, 106, 444, 450, 545, 552, 553]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 715 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 733/869 places, 1673/1774 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 730 transition count 1670
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 730 transition count 1670
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 729 transition count 1669
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 729 transition count 1669
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 728 transition count 1668
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 728 transition count 1667
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 13 place count 728 transition count 1665
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 15 place count 726 transition count 1665
Applied a total of 15 rules in 94 ms. Remains 726 /733 variables (removed 7) and now considering 1665/1673 (removed 8) transitions.
// Phase 1: matrix 1665 rows 726 cols
[2023-03-13 00:30:41] [INFO ] Computed 86 place invariants in 33 ms
[2023-03-13 00:30:42] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-13 00:30:42] [INFO ] Invariant cache hit.
[2023-03-13 00:30:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 00:30:44] [INFO ] Implicit Places using invariants and state equation in 1931 ms returned []
Implicit Place search using SMT with State Equation took 2587 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 726/869 places, 1665/1774 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4318 ms. Remains : 726/869 places, 1665/1774 transitions.
Incomplete random walk after 10000 steps, including 99 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 259997 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 259997 steps, saw 63668 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-13 00:30:47] [INFO ] Invariant cache hit.
[2023-03-13 00:30:48] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:30:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-03-13 00:30:48] [INFO ] [Nat]Absence check using 17 positive and 69 generalized place invariants in 39 ms returned sat
[2023-03-13 00:30:50] [INFO ] After 1786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:30:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 00:30:51] [INFO ] After 883ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-13 00:30:53] [INFO ] Deduced a trap composed of 26 places in 345 ms of which 0 ms to minimize.
[2023-03-13 00:30:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 465 ms
[2023-03-13 00:30:53] [INFO ] Deduced a trap composed of 33 places in 268 ms of which 15 ms to minimize.
[2023-03-13 00:30:54] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 1 ms to minimize.
[2023-03-13 00:30:54] [INFO ] Deduced a trap composed of 69 places in 346 ms of which 1 ms to minimize.
[2023-03-13 00:30:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1204 ms
[2023-03-13 00:30:55] [INFO ] Deduced a trap composed of 72 places in 268 ms of which 1 ms to minimize.
[2023-03-13 00:30:55] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 1 ms to minimize.
[2023-03-13 00:30:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-13 00:30:55] [INFO ] After 5080ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 1298 ms.
[2023-03-13 00:30:56] [INFO ] After 8542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 204 ms.
Support contains 64 out of 726 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1665/1665 transitions.
Applied a total of 0 rules in 21 ms. Remains 726 /726 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 726/726 places, 1665/1665 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 726/726 places, 1665/1665 transitions.
Applied a total of 0 rules in 26 ms. Remains 726 /726 variables (removed 0) and now considering 1665/1665 (removed 0) transitions.
[2023-03-13 00:30:57] [INFO ] Invariant cache hit.
[2023-03-13 00:30:57] [INFO ] Implicit Places using invariants in 666 ms returned []
[2023-03-13 00:30:57] [INFO ] Invariant cache hit.
[2023-03-13 00:30:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 00:30:59] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2391 ms to find 0 implicit places.
[2023-03-13 00:30:59] [INFO ] Redundant transitions in 164 ms returned []
[2023-03-13 00:30:59] [INFO ] Invariant cache hit.
[2023-03-13 00:31:00] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3378 ms. Remains : 726/726 places, 1665/1665 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 726 transition count 1663
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 724 transition count 1663
Applied a total of 4 rules in 28 ms. Remains 724 /726 variables (removed 2) and now considering 1663/1665 (removed 2) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1663 rows 724 cols
[2023-03-13 00:31:00] [INFO ] Computed 86 place invariants in 12 ms
[2023-03-13 00:31:00] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 00:31:00] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-13 00:31:01] [INFO ] [Nat]Absence check using 16 positive and 70 generalized place invariants in 55 ms returned sat
[2023-03-13 00:31:04] [INFO ] After 3035ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-13 00:31:05] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 0 ms to minimize.
[2023-03-13 00:31:05] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 0 ms to minimize.
[2023-03-13 00:31:06] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2023-03-13 00:31:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1507 ms
[2023-03-13 00:31:07] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 1 ms to minimize.
[2023-03-13 00:31:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 438 ms
[2023-03-13 00:31:07] [INFO ] After 6337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 870 ms.
[2023-03-13 00:31:08] [INFO ] After 7622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-13 00:31:08] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2023-03-13 00:31:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 726 places, 1665 transitions and 6645 arcs took 21 ms.
[2023-03-13 00:31:08] [INFO ] Flatten gal took : 167 ms
Total runtime 219088 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: ASLink_PT_07b
(NrP: 726 NrTr: 1665 NrArc: 6645)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.087sec

net check time: 0m 0.000sec

init dd package: 0m 3.111sec


before gc: list nodes free: 915665

after gc: idd nodes used:17398, unused:63982602; list nodes free:259967240

before gc: list nodes free: 815684

after gc: idd nodes used:17752, unused:63982248; list nodes free:259964596

before gc: list nodes free: 794822

after gc: idd nodes used:17825, unused:63982175; list nodes free:259964590

before gc: list nodes free: 49059

after gc: idd nodes used:19417, unused:63980583; list nodes free:259957042
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6650316 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097360 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.010sec

4804 5375 5793 6225 6458 6401 6029 6399 5823 6209 5730 6193 5938 7514 7766 8792 8308 8579 8609 9160 8703 8826 8143 8955 8673 8719 9288 8851 8983 8710 9327 8832 8844 8466 8909 8663 8740 8990 8797 9102 15696 16313 15811 16140 16068 16014 16383 16431 16430 16031 16458 16649 17256 17036 16554 17176 16730 16780 16515 16939 16634 16696 16033 16747 17098 16580 17214 16643 16939 16492 17062 16517 16657 15794 16803 16920 16527 17160 16668 16254 16424 16067 16493 15749 16300 15988 16010 16184 15763 16329 16887 16324 16750 17085 16637 17268 16674 16850 16446 16901 16477 16692 16548 16779 17096 16615 17218 16706 16816 16516 16835 16624 16652 16014 16723 17086 16537 17167 15891 16177 16205 16253 16282 16332 15981 16545 15742 16257 15977 16791 16565 16815 16618 17039 16583 17209 16725 16760 16308 16923 16575 16622 16748 16796 17120 16600 17225 16751 16829 16418 16876 16441 16654 16532 16735 17030 15702 16310 15681 16222 16170 16084 16281 16275 16444 16218 16478 16646 17273 16707 16571 17489 16786 16855 16592 16997 16680 16702 16332 16755 16528 16674 16848 16647 17003 16573 17228 16703 16665 16275 16859 16467 16578 16701 16731 16332 16431 16064 16322 15741 16197 15893 16030 16110 16016 16173 17129 16246 16849 17082 16636 17272 16801 16909 16549 17097 16707 16692 15564 16846 16772 16619 17191 16752 16877 16580 17107 16656 16676 16264 16710 16485 16614 16786 17588 17807 17550 18175 17619 17756 17293 17877 17495 17613 17737 17791 18144 17587 18220 17720 17843 17058 18305 17338 17943 17505 17622 17264 17821 17456 17412 17021 17612 17223 17293 17622 17372 17688 17297 17952 18239 18004 17618 18258 17823 18076 18201 18140 18488 17927 18560 18057 18178 17793 18151 17960 18036 17425 18541 18438 17986 18616 18153 18251 17920 18509 18009 18099 17285 18231 18356 17971 18604 18133 18262 18530 19061 18119 18153 17773 18227 18023 18164 18319 18122 18463 18065 18687 18039 18193 17900 18376 17932 18600 18674 18312 18560 18144 18755 18261 18352

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-07b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ASLink-PT-07b, 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 r010-oct2-167813598600119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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