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

About the Execution of Marcie+red for RERS2020-PT-pb103

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2442.855 1800000.00 2038988.00 5706.90 [undef] Time out reached

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.r344-tall-167889215900148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 RERS2020-PT-pb103, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r344-tall-167889215900148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 7.2K Feb 26 08:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 08:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 08:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 08:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 26 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 08:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 08:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18M Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679134884994

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=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=RERS2020-PT-pb103
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 10:21:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-18 10:21:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 10:21:27] [INFO ] Load time of PNML (sax parser for PT used): 780 ms
[2023-03-18 10:21:27] [INFO ] Transformed 520 places.
[2023-03-18 10:21:27] [INFO ] Transformed 31658 transitions.
[2023-03-18 10:21:27] [INFO ] Found NUPN structural information;
[2023-03-18 10:21:27] [INFO ] Parsed PT model containing 520 places and 31658 transitions and 125892 arcs in 1104 ms.
Ensure Unique test removed 3229 transitions
Reduce redundant transitions removed 3229 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 520) seen :218
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 302) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 302) seen :3
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=16 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=10 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 299) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=20 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 298) seen :0
Running SMT prover for 298 properties.
[2023-03-18 10:21:29] [INFO ] Flow matrix only has 18674 transitions (discarded 9755 similar events)
// Phase 1: matrix 18674 rows 520 cols
[2023-03-18 10:21:29] [INFO ] Computed 15 place invariants in 128 ms
[2023-03-18 10:21:35] [INFO ] After 3559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:298
[2023-03-18 10:21:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 10 ms returned sat
[2023-03-18 10:21:37] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-18 10:22:00] [INFO ] After 20565ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :298
[2023-03-18 10:22:00] [INFO ] State equation strengthened by 1379 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.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:22:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:22:00] [INFO ] After 25231ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:298
Fused 298 Parikh solutions to 56 different solutions.
Parikh walk visited 0 properties in 211 ms.
Support contains 298 out of 520 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 520/520 places, 28429/28429 transitions.
Ensure Unique test removed 7 places
Drop transitions removed 1062 transitions
Reduce isomorphic transitions removed 1062 transitions.
Iterating post reduction 0 with 1069 rules applied. Total rules applied 1069 place count 513 transition count 27367
Free-agglomeration rule applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 1077 place count 513 transition count 27359
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 1 with 95 rules applied. Total rules applied 1172 place count 505 transition count 27272
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 1173 place count 504 transition count 27271
Applied a total of 1173 rules in 613 ms. Remains 504 /520 variables (removed 16) and now considering 27271/28429 (removed 1158) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 624 ms. Remains : 504/520 places, 27271/28429 transitions.
Interrupted random walk after 490865 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties seen 31
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 267) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 258) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 254) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 252) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 247) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 246) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 238) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 234) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 234) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 232) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 231) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 229) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 225) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 225) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 224) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 224) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 223) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 223) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 222) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:22:36] [INFO ] Flow matrix only has 18595 transitions (discarded 8676 similar events)
// Phase 1: matrix 18595 rows 504 cols
[2023-03-18 10:22:36] [INFO ] Computed 8 place invariants in 84 ms
[2023-03-18 10:22:40] [INFO ] After 2148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:22:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:23:54] [INFO ] After 70634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:23:54] [INFO ] State equation strengthened by 1371 read => feed constraints.
[2023-03-18 10:26:25] [INFO ] After 150909ms SMT Verify possible using 1371 Read/Feed constraints in natural domain returned unsat :0 sat :221
[2023-03-18 10:26:25] [INFO ] After 150910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :221
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 10:26:25] [INFO ] After 225064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :221
Fused 221 Parikh solutions to 220 different solutions.
Parikh walk visited 0 properties in 655 ms.
Support contains 221 out of 504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 504/504 places, 27271/27271 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 504 transition count 27270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 503 transition count 27270
Applied a total of 2 rules in 280 ms. Remains 503 /504 variables (removed 1) and now considering 27270/27271 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 282 ms. Remains : 503/504 places, 27270/27271 transitions.
Interrupted random walk after 483708 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=16 ) properties 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 221) 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 221) 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 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1121989 steps, run timeout after 99001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1121989 steps, saw 573107 distinct states, run finished after 99005 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:28:38] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:28:38] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-18 10:28:41] [INFO ] After 2162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:28:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:29:56] [INFO ] After 71562ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:29:56] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:32:26] [INFO ] After 150215ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :217
[2023-03-18 10:32:26] [INFO ] After 150222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :217
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 10:32:26] [INFO ] After 225046ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :217
Parikh walk visited 0 properties in 598 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 115 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 127 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:32:27] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:32:27] [INFO ] Invariant cache hit.
[2023-03-18 10:32:28] [INFO ] Implicit Places using invariants in 577 ms returned []
Implicit Place search using SMT only with invariants took 579 ms to find 0 implicit places.
[2023-03-18 10:32:28] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:32:28] [INFO ] Invariant cache hit.
[2023-03-18 10:32:35] [INFO ] Dead Transitions using invariants and state equation in 7717 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8426 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 5596 ms. (steps per millisecond=17 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:32:41] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:32:41] [INFO ] Invariant cache hit.
[2023-03-18 10:32:42] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:32:49] [INFO ] After 7151ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:32:50] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:33:03] [INFO ] After 12816ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:33:05] [INFO ] Deduced a trap composed of 101 places in 2017 ms of which 4 ms to minimize.
[2023-03-18 10:33:07] [INFO ] Deduced a trap composed of 79 places in 2040 ms of which 1 ms to minimize.
[2023-03-18 10:33:10] [INFO ] Deduced a trap composed of 93 places in 1898 ms of which 6 ms to minimize.
[2023-03-18 10:33:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7372 ms
[2023-03-18 10:33:13] [INFO ] Deduced a trap composed of 85 places in 1506 ms of which 2 ms to minimize.
[2023-03-18 10:33:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2220 ms
[2023-03-18 10:33:17] [INFO ] Deduced a trap composed of 84 places in 1541 ms of which 1 ms to minimize.
[2023-03-18 10:33:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2258 ms
[2023-03-18 10:33:21] [INFO ] Deduced a trap composed of 125 places in 1334 ms of which 1 ms to minimize.
[2023-03-18 10:33:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2053 ms
[2023-03-18 10:33:23] [INFO ] Deduced a trap composed of 13 places in 1543 ms of which 1 ms to minimize.
[2023-03-18 10:33:25] [INFO ] Deduced a trap composed of 68 places in 1455 ms of which 1 ms to minimize.
[2023-03-18 10:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4063 ms
[2023-03-18 10:33:28] [INFO ] Deduced a trap composed of 11 places in 1684 ms of which 0 ms to minimize.
[2023-03-18 10:33:30] [INFO ] Deduced a trap composed of 136 places in 1591 ms of which 1 ms to minimize.
[2023-03-18 10:33:32] [INFO ] Deduced a trap composed of 51 places in 1528 ms of which 0 ms to minimize.
[2023-03-18 10:33:34] [INFO ] Deduced a trap composed of 106 places in 1621 ms of which 0 ms to minimize.
[2023-03-18 10:33:35] [INFO ] Deduced a trap composed of 149 places in 1468 ms of which 0 ms to minimize.
[2023-03-18 10:33:37] [INFO ] Deduced a trap composed of 92 places in 1515 ms of which 0 ms to minimize.
[2023-03-18 10:33:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 11894 ms
[2023-03-18 10:33:40] [INFO ] Deduced a trap composed of 11 places in 1147 ms of which 1 ms to minimize.
[2023-03-18 10:33:42] [INFO ] Deduced a trap composed of 79 places in 1326 ms of which 0 ms to minimize.
[2023-03-18 10:33:43] [INFO ] Deduced a trap composed of 206 places in 1076 ms of which 1 ms to minimize.
[2023-03-18 10:33:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4985 ms
[2023-03-18 10:33:46] [INFO ] Deduced a trap composed of 95 places in 1369 ms of which 1 ms to minimize.
[2023-03-18 10:33:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2108 ms
[2023-03-18 10:33:48] [INFO ] Deduced a trap composed of 129 places in 1241 ms of which 1 ms to minimize.
[2023-03-18 10:33:49] [INFO ] Deduced a trap composed of 163 places in 1224 ms of which 0 ms to minimize.
[2023-03-18 10:33:51] [INFO ] Deduced a trap composed of 184 places in 1697 ms of which 1 ms to minimize.
[2023-03-18 10:33:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5600 ms
[2023-03-18 10:33:54] [INFO ] Deduced a trap composed of 93 places in 1581 ms of which 1 ms to minimize.
[2023-03-18 10:33:56] [INFO ] Deduced a trap composed of 196 places in 1354 ms of which 0 ms to minimize.
[2023-03-18 10:33:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4025 ms
[2023-03-18 10:33:58] [INFO ] Deduced a trap composed of 49 places in 1063 ms of which 0 ms to minimize.
[2023-03-18 10:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1799 ms
[2023-03-18 10:34:00] [INFO ] Deduced a trap composed of 94 places in 1740 ms of which 0 ms to minimize.
[2023-03-18 10:34:02] [INFO ] Deduced a trap composed of 77 places in 1501 ms of which 0 ms to minimize.
[2023-03-18 10:34:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4300 ms
[2023-03-18 10:34:05] [INFO ] Deduced a trap composed of 72 places in 1460 ms of which 1 ms to minimize.
[2023-03-18 10:34:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2166 ms
[2023-03-18 10:34:12] [INFO ] Deduced a trap composed of 187 places in 1722 ms of which 0 ms to minimize.
[2023-03-18 10:34:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2408 ms
[2023-03-18 10:34:19] [INFO ] Deduced a trap composed of 72 places in 1062 ms of which 0 ms to minimize.
[2023-03-18 10:34:20] [INFO ] Deduced a trap composed of 63 places in 1019 ms of which 1 ms to minimize.
[2023-03-18 10:34:22] [INFO ] Deduced a trap composed of 54 places in 989 ms of which 1 ms to minimize.
[2023-03-18 10:34:24] [INFO ] Deduced a trap composed of 12 places in 2153 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:46)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:225)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:34:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:34:24] [INFO ] After 102240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 461810 steps, including 1 resets, run timeout after 30001 ms. (steps per millisecond=15 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 221) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 221) seen :0
Interrupted probabilistic random walk after 1121243 steps, run timeout after 99001 ms. (steps per millisecond=11 ) properties seen :{}
Probabilistic random walk after 1121243 steps, saw 572752 distinct states, run finished after 99002 ms. (steps per millisecond=11 ) properties seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:36:37] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:36:37] [INFO ] Invariant cache hit.
[2023-03-18 10:36:40] [INFO ] After 2190ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:221
[2023-03-18 10:36:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-18 10:37:58] [INFO ] After 74189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :221
[2023-03-18 10:37:58] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:40:25] [INFO ] After 147599ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :220
[2023-03-18 10:40:25] [INFO ] After 147601ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :220
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-18 10:40:25] [INFO ] After 225044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :220
Parikh walk visited 0 properties in 623 ms.
Support contains 221 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 107 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 503/503 places, 27270/27270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Applied a total of 0 rules in 110 ms. Remains 503 /503 variables (removed 0) and now considering 27270/27270 (removed 0) transitions.
[2023-03-18 10:40:26] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:40:26] [INFO ] Invariant cache hit.
[2023-03-18 10:40:27] [INFO ] Implicit Places using invariants in 542 ms returned []
Implicit Place search using SMT only with invariants took 555 ms to find 0 implicit places.
[2023-03-18 10:40:27] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:40:27] [INFO ] Invariant cache hit.
[2023-03-18 10:40:34] [INFO ] Dead Transitions using invariants and state equation in 7408 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8076 ms. Remains : 503/503 places, 27270/27270 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 5443 ms. (steps per millisecond=18 ) properties (out of 221) seen :0
Running SMT prover for 221 properties.
[2023-03-18 10:40:40] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:40:40] [INFO ] Invariant cache hit.
[2023-03-18 10:40:40] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:40:48] [INFO ] After 7152ms SMT Verify possible using state equation in real domain returned unsat :0 sat :221
[2023-03-18 10:40:48] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:41:00] [INFO ] After 12413ms SMT Verify possible using 1370 Read/Feed constraints in real domain returned unsat :0 sat :221
[2023-03-18 10:41:03] [INFO ] Deduced a trap composed of 101 places in 1939 ms of which 1 ms to minimize.
[2023-03-18 10:41:05] [INFO ] Deduced a trap composed of 79 places in 2087 ms of which 1 ms to minimize.
[2023-03-18 10:41:08] [INFO ] Deduced a trap composed of 93 places in 2212 ms of which 4 ms to minimize.
[2023-03-18 10:41:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7719 ms
[2023-03-18 10:41:12] [INFO ] Deduced a trap composed of 85 places in 1633 ms of which 1 ms to minimize.
[2023-03-18 10:41:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2360 ms
[2023-03-18 10:41:15] [INFO ] Deduced a trap composed of 84 places in 1681 ms of which 0 ms to minimize.
[2023-03-18 10:41:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2425 ms
[2023-03-18 10:41:20] [INFO ] Deduced a trap composed of 125 places in 1517 ms of which 0 ms to minimize.
[2023-03-18 10:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2257 ms
[2023-03-18 10:41:22] [INFO ] Deduced a trap composed of 13 places in 1699 ms of which 1 ms to minimize.
[2023-03-18 10:41:24] [INFO ] Deduced a trap composed of 68 places in 1632 ms of which 1 ms to minimize.
[2023-03-18 10:41:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4408 ms
[2023-03-18 10:41:27] [INFO ] Deduced a trap composed of 11 places in 1889 ms of which 0 ms to minimize.
[2023-03-18 10:41:29] [INFO ] Deduced a trap composed of 136 places in 1787 ms of which 1 ms to minimize.
[2023-03-18 10:41:31] [INFO ] Deduced a trap composed of 51 places in 1702 ms of which 1 ms to minimize.
[2023-03-18 10:41:33] [INFO ] Deduced a trap composed of 106 places in 1790 ms of which 0 ms to minimize.
[2023-03-18 10:41:35] [INFO ] Deduced a trap composed of 149 places in 1683 ms of which 1 ms to minimize.
[2023-03-18 10:41:37] [INFO ] Deduced a trap composed of 92 places in 1525 ms of which 1 ms to minimize.
[2023-03-18 10:41:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 12887 ms
[2023-03-18 10:41:40] [INFO ] Deduced a trap composed of 11 places in 1194 ms of which 1 ms to minimize.
[2023-03-18 10:41:42] [INFO ] Deduced a trap composed of 79 places in 1314 ms of which 1 ms to minimize.
[2023-03-18 10:41:43] [INFO ] Deduced a trap composed of 206 places in 1048 ms of which 0 ms to minimize.
[2023-03-18 10:41:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5001 ms
[2023-03-18 10:41:46] [INFO ] Deduced a trap composed of 95 places in 1340 ms of which 1 ms to minimize.
[2023-03-18 10:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2087 ms
[2023-03-18 10:41:48] [INFO ] Deduced a trap composed of 129 places in 1272 ms of which 1 ms to minimize.
[2023-03-18 10:41:49] [INFO ] Deduced a trap composed of 163 places in 1211 ms of which 1 ms to minimize.
[2023-03-18 10:41:51] [INFO ] Deduced a trap composed of 184 places in 1598 ms of which 0 ms to minimize.
[2023-03-18 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 5466 ms
[2023-03-18 10:41:54] [INFO ] Deduced a trap composed of 93 places in 1627 ms of which 1 ms to minimize.
[2023-03-18 10:41:56] [INFO ] Deduced a trap composed of 196 places in 1309 ms of which 0 ms to minimize.
[2023-03-18 10:41:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4016 ms
[2023-03-18 10:41:58] [INFO ] Deduced a trap composed of 49 places in 1054 ms of which 0 ms to minimize.
[2023-03-18 10:41:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1788 ms
[2023-03-18 10:42:00] [INFO ] Deduced a trap composed of 94 places in 1741 ms of which 1 ms to minimize.
[2023-03-18 10:42:02] [INFO ] Deduced a trap composed of 77 places in 1515 ms of which 1 ms to minimize.
[2023-03-18 10:42:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4425 ms
[2023-03-18 10:42:05] [INFO ] Deduced a trap composed of 72 places in 1410 ms of which 0 ms to minimize.
[2023-03-18 10:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2179 ms
[2023-03-18 10:42:12] [INFO ] Deduced a trap composed of 187 places in 1667 ms of which 1 ms to minimize.
[2023-03-18 10:42:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2359 ms
[2023-03-18 10:42:19] [INFO ] Deduced a trap composed of 72 places in 1004 ms of which 1 ms to minimize.
[2023-03-18 10:42:21] [INFO ] Deduced a trap composed of 63 places in 1003 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:215)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:267)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:42:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:42:21] [INFO ] After 100154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 42053 steps, run timeout after 3001 ms. (steps per millisecond=14 ) properties seen :{}
Probabilistic random walk after 42053 steps, saw 29677 distinct states, run finished after 3001 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:42:24] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
[2023-03-18 10:42:24] [INFO ] Invariant cache hit.
[2023-03-18 10:42:24] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:42:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:42:27] [INFO ] After 3325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:27] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:42:36] [INFO ] After 8757ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:38] [INFO ] After 10197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 455 ms.
[2023-03-18 10:42:38] [INFO ] After 14188ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 462 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 464 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41936 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41936 steps, saw 29596 distinct states, run finished after 3002 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:42:42] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:42:42] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-18 10:42:42] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:42:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 13 ms returned sat
[2023-03-18 10:42:46] [INFO ] After 3462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:46] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:42:55] [INFO ] After 9170ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:42:57] [INFO ] Deduced a trap composed of 79 places in 1760 ms of which 3 ms to minimize.
[2023-03-18 10:42:59] [INFO ] Deduced a trap composed of 101 places in 1841 ms of which 8 ms to minimize.
[2023-03-18 10:43:02] [INFO ] Deduced a trap composed of 92 places in 1651 ms of which 0 ms to minimize.
[2023-03-18 10:43:03] [INFO ] Deduced a trap composed of 60 places in 1346 ms of which 1 ms to minimize.
[2023-03-18 10:43:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 8621 ms
[2023-03-18 10:43:04] [INFO ] After 18329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 499 ms.
[2023-03-18 10:43:05] [INFO ] After 22493ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 97 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 96 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:43:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:43:05] [INFO ] Invariant cache hit.
[2023-03-18 10:43:06] [INFO ] Implicit Places using invariants in 894 ms returned []
Implicit Place search using SMT only with invariants took 894 ms to find 0 implicit places.
[2023-03-18 10:43:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:43:06] [INFO ] Invariant cache hit.
[2023-03-18 10:43:13] [INFO ] Dead Transitions using invariants and state equation in 7763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8757 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10356 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 6 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Iterating post reduction 4 with 114 rules applied. Total rules applied 1380 place count 143 transition count 939
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1382 place count 141 transition count 929
Iterating global reduction 5 with 2 rules applied. Total rules applied 1384 place count 141 transition count 929
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1385 place count 141 transition count 928
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 6 with 2 rules applied. Total rules applied 1387 place count 140 transition count 927
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 1510 place count 127 transition count 809
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 9 rules applied. Total rules applied 1519 place count 122 transition count 805
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1523 place count 122 transition count 801
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1524 place count 122 transition count 800
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1527 place count 121 transition count 798
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1530 place count 121 transition count 795
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1533 place count 120 transition count 793
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1535 place count 120 transition count 791
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1540 place count 120 transition count 875
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1561 place count 115 transition count 859
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1562 place count 114 transition count 855
Iterating global reduction 12 with 1 rules applied. Total rules applied 1563 place count 114 transition count 855
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1572 place count 114 transition count 846
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1591 place count 114 transition count 827
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 1593 place count 114 transition count 827
Applied a total of 1593 rules in 316 ms. Remains 114 /497 variables (removed 383) and now considering 827/27456 (removed 26629) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:43:14] [INFO ] Flow matrix only has 786 transitions (discarded 41 similar events)
// Phase 1: matrix 786 rows 114 cols
[2023-03-18 10:43:14] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-18 10:43:14] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:43:14] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:43:14] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:43:14] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:43:14] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 10:43:14] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 39912 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39912 steps, saw 28271 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:43:17] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:43:17] [INFO ] Computed 8 place invariants in 69 ms
[2023-03-18 10:43:18] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:43:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:43:21] [INFO ] After 3357ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:43:21] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:43:31] [INFO ] After 9969ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-18 10:43:31] [INFO ] After 13515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 509 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41377 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41377 steps, saw 29243 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:43:35] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:43:35] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 10:43:35] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:43:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-18 10:43:38] [INFO ] After 3400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:43:39] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:43:49] [INFO ] After 10058ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:43:51] [INFO ] Deduced a trap composed of 49 places in 1728 ms of which 1 ms to minimize.
[2023-03-18 10:43:52] [INFO ] Deduced a trap composed of 51 places in 1370 ms of which 6 ms to minimize.
[2023-03-18 10:43:54] [INFO ] Deduced a trap composed of 58 places in 1623 ms of which 1 ms to minimize.
[2023-03-18 10:43:57] [INFO ] Deduced a trap composed of 102 places in 1840 ms of which 0 ms to minimize.
[2023-03-18 10:44:00] [INFO ] Deduced a trap composed of 60 places in 1692 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:44:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:44:00] [INFO ] After 25518ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 131 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 124 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:44:01] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:44:01] [INFO ] Invariant cache hit.
[2023-03-18 10:44:02] [INFO ] Implicit Places using invariants in 937 ms returned []
Implicit Place search using SMT only with invariants took 938 ms to find 0 implicit places.
[2023-03-18 10:44:02] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:44:02] [INFO ] Invariant cache hit.
[2023-03-18 10:44:10] [INFO ] Dead Transitions using invariants and state equation in 8104 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9169 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10311 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 3 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1202 transitions
Redundant transition composition rules discarded 1202 transitions
Iterating global reduction 3 with 1202 rules applied. Total rules applied 1260 place count 165 transition count 1059
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 1220 edges and 162 vertex of which 2 are kept as prefixes of interest. Removing 160 places using SCC suffix rule.1 ms
Discarding 160 places :
Also discarding 1034 output transitions
Drop transitions removed 1034 transitions
Iterating post reduction 3 with 15 rules applied. Total rules applied 1275 place count 2 transition count 14
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 1288 place count 2 transition count 1
Applied a total of 1288 rules in 143 ms. Remains 2 /497 variables (removed 495) and now considering 1/27456 (removed 27455) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1 rows 2 cols
[2023-03-18 10:44:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-18 10:44:10] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:44:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 10:44:10] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:44:10] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 10:44:10] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41730 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41730 steps, saw 29483 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:44:13] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:44:13] [INFO ] Computed 8 place invariants in 73 ms
[2023-03-18 10:44:13] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:44:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:44:17] [INFO ] After 3319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:44:17] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:44:23] [INFO ] After 5976ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:44:25] [INFO ] Deduced a trap composed of 13 places in 800 ms of which 1 ms to minimize.
[2023-03-18 10:44:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1569 ms
[2023-03-18 10:44:25] [INFO ] After 8542ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1339 ms.
[2023-03-18 10:44:27] [INFO ] After 13390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 427 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 428 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41411 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41411 steps, saw 29265 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:44:31] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:44:31] [INFO ] Computed 8 place invariants in 50 ms
[2023-03-18 10:44:31] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:44:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:44:34] [INFO ] After 3404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:44:34] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:44:37] [INFO ] After 2293ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:44:39] [INFO ] Deduced a trap composed of 13 places in 1584 ms of which 1 ms to minimize.
[2023-03-18 10:44:41] [INFO ] Deduced a trap composed of 147 places in 1481 ms of which 0 ms to minimize.
[2023-03-18 10:44:42] [INFO ] Deduced a trap composed of 19 places in 1469 ms of which 6 ms to minimize.
[2023-03-18 10:44:44] [INFO ] Deduced a trap composed of 47 places in 1655 ms of which 0 ms to minimize.
[2023-03-18 10:44:46] [INFO ] Deduced a trap composed of 188 places in 1492 ms of which 1 ms to minimize.
[2023-03-18 10:44:48] [INFO ] Deduced a trap composed of 60 places in 1472 ms of which 0 ms to minimize.
[2023-03-18 10:44:50] [INFO ] Deduced a trap composed of 76 places in 1647 ms of which 0 ms to minimize.
[2023-03-18 10:44:52] [INFO ] Deduced a trap composed of 84 places in 1555 ms of which 1 ms to minimize.
[2023-03-18 10:44:54] [INFO ] Deduced a trap composed of 121 places in 1086 ms of which 0 ms to minimize.
[2023-03-18 10:44:56] [INFO ] Deduced a trap composed of 92 places in 897 ms of which 0 ms to minimize.
[2023-03-18 10:44:56] [INFO ] Trap strengthening (SAT) tested/added 10/10 trap constraints in 18816 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:44:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:44:56] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 118 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 116 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:44:56] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:44:56] [INFO ] Invariant cache hit.
[2023-03-18 10:44:57] [INFO ] Implicit Places using invariants in 907 ms returned []
Implicit Place search using SMT only with invariants took 907 ms to find 0 implicit places.
[2023-03-18 10:44:57] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:44:57] [INFO ] Invariant cache hit.
[2023-03-18 10:45:04] [INFO ] Dead Transitions using invariants and state equation in 7525 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8551 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10249 edges and 497 vertex of which 378 / 497 are part of one of the 61 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 10913 transitions
Ensure Unique test removed 14180 transitions
Reduce isomorphic transitions removed 25093 transitions.
Graph (complete) has 2405 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 172 transition count 2349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2349
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2339
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2339
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2337
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2304
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2314
Drop transitions removed 1204 transitions
Redundant transition composition rules discarded 1204 transitions
Iterating global reduction 3 with 1204 rules applied. Total rules applied 1263 place count 166 transition count 1110
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1292 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1274 place count 146 transition count 1099
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1387 place count 146 transition count 986
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1389 place count 144 transition count 976
Iterating global reduction 5 with 2 rules applied. Total rules applied 1391 place count 144 transition count 976
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1392 place count 144 transition count 975
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 6 with 2 rules applied. Total rules applied 1394 place count 143 transition count 974
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1399 place count 143 transition count 969
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1411 place count 143 transition count 950
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1443 place count 131 transition count 930
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1444 place count 130 transition count 926
Iterating global reduction 7 with 1 rules applied. Total rules applied 1445 place count 130 transition count 926
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1453 place count 130 transition count 918
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1511 place count 130 transition count 860
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1517 place count 130 transition count 854
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1527 place count 124 transition count 850
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 1534 place count 124 transition count 843
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1536 place count 124 transition count 841
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1540 place count 122 transition count 839
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1544 place count 122 transition count 835
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1546 place count 122 transition count 833
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1550 place count 120 transition count 831
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 1553 place count 120 transition count 828
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1557 place count 120 transition count 912
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 19 rules applied. Total rules applied 1576 place count 116 transition count 897
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1577 place count 115 transition count 893
Iterating global reduction 12 with 1 rules applied. Total rules applied 1578 place count 115 transition count 893
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1587 place count 115 transition count 884
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1606 place count 115 transition count 865
Applied a total of 1606 rules in 231 ms. Remains 115 /497 variables (removed 382) and now considering 865/27456 (removed 26591) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:45:05] [INFO ] Flow matrix only has 824 transitions (discarded 41 similar events)
// Phase 1: matrix 824 rows 115 cols
[2023-03-18 10:45:05] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-18 10:45:05] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:45:05] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:05] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:45:05] [INFO ] After 28ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:05] [INFO ] After 58ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 10:45:05] [INFO ] After 218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41317 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41317 steps, saw 29203 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:45:08] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:45:08] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-18 10:45:08] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:45:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:45:12] [INFO ] After 3517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:12] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:45:19] [INFO ] After 7320ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:22] [INFO ] Deduced a trap composed of 91 places in 1604 ms of which 1 ms to minimize.
[2023-03-18 10:45:24] [INFO ] Deduced a trap composed of 72 places in 1735 ms of which 0 ms to minimize.
[2023-03-18 10:45:27] [INFO ] Deduced a trap composed of 92 places in 1677 ms of which 1 ms to minimize.
[2023-03-18 10:45:30] [INFO ] Deduced a trap composed of 51 places in 1854 ms of which 0 ms to minimize.
[2023-03-18 10:45:32] [INFO ] Deduced a trap composed of 159 places in 1861 ms of which 1 ms to minimize.
[2023-03-18 10:45:35] [INFO ] Deduced a trap composed of 71 places in 2027 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:45:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:45:35] [INFO ] After 26341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 531 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41101 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41101 steps, saw 29087 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:45:38] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:45:39] [INFO ] Computed 8 place invariants in 73 ms
[2023-03-18 10:45:39] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:45:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:45:42] [INFO ] After 3505ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:42] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:45:53] [INFO ] After 10195ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:45:55] [INFO ] Deduced a trap composed of 12 places in 1458 ms of which 1 ms to minimize.
[2023-03-18 10:45:57] [INFO ] Deduced a trap composed of 11 places in 1487 ms of which 0 ms to minimize.
[2023-03-18 10:45:59] [INFO ] Deduced a trap composed of 32 places in 1677 ms of which 0 ms to minimize.
[2023-03-18 10:46:02] [INFO ] Deduced a trap composed of 75 places in 1764 ms of which 1 ms to minimize.
[2023-03-18 10:46:04] [INFO ] Deduced a trap composed of 93 places in 1597 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:46:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:46:04] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 109 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 107 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:46:04] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:46:04] [INFO ] Invariant cache hit.
[2023-03-18 10:46:05] [INFO ] Implicit Places using invariants in 875 ms returned []
Implicit Place search using SMT only with invariants took 876 ms to find 0 implicit places.
[2023-03-18 10:46:05] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:46:05] [INFO ] Invariant cache hit.
[2023-03-18 10:46:13] [INFO ] Dead Transitions using invariants and state equation in 7696 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8682 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10333 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 170 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 170 transition count 2295
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 168 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 167 transition count 2285
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 167 transition count 2285
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 165 transition count 2283
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 165 transition count 2250
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 164 transition count 2260
Drop transitions removed 1196 transitions
Redundant transition composition rules discarded 1196 transitions
Iterating global reduction 3 with 1196 rules applied. Total rules applied 1255 place count 164 transition count 1064
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1223 edges and 162 vertex of which 143 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1266 place count 143 transition count 1053
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 4 with 115 rules applied. Total rules applied 1381 place count 143 transition count 938
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1383 place count 141 transition count 928
Iterating global reduction 5 with 2 rules applied. Total rules applied 1385 place count 141 transition count 928
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1386 place count 141 transition count 927
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 6 with 2 rules applied. Total rules applied 1388 place count 140 transition count 926
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 140 transition count 921
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 140 transition count 902
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 128 transition count 882
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 127 transition count 880
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 127 transition count 880
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 127 transition count 872
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 127 transition count 814
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 127 transition count 808
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 121 transition count 804
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 121 transition count 798
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1529 place count 121 transition count 796
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1533 place count 119 transition count 794
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1537 place count 119 transition count 790
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1539 place count 119 transition count 788
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1543 place count 117 transition count 786
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1545 place count 117 transition count 784
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1550 place count 117 transition count 868
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1571 place count 112 transition count 852
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1572 place count 111 transition count 848
Iterating global reduction 12 with 1 rules applied. Total rules applied 1573 place count 111 transition count 848
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1582 place count 111 transition count 839
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1601 place count 111 transition count 820
Applied a total of 1601 rules in 208 ms. Remains 111 /497 variables (removed 386) and now considering 820/27456 (removed 26636) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:46:13] [INFO ] Flow matrix only has 779 transitions (discarded 41 similar events)
// Phase 1: matrix 779 rows 111 cols
[2023-03-18 10:46:13] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-18 10:46:13] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:46:13] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:46:13] [INFO ] After 22ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:13] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-18 10:46:13] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41801 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41801 steps, saw 29521 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:46:16] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:46:16] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 10:46:16] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:46:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:46:20] [INFO ] After 3397ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:20] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:46:30] [INFO ] After 9921ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-18 10:46:30] [INFO ] After 13497ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 480 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 480 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41043 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41043 steps, saw 29054 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:46:34] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:46:34] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:46:34] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:46:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:46:38] [INFO ] After 3705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:38] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:46:41] [INFO ] After 3397ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:45] [INFO ] Deduced a trap composed of 51 places in 2156 ms of which 0 ms to minimize.
[2023-03-18 10:46:47] [INFO ] Deduced a trap composed of 60 places in 1876 ms of which 0 ms to minimize.
[2023-03-18 10:46:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 5512 ms
[2023-03-18 10:46:48] [INFO ] After 10384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1023 ms.
[2023-03-18 10:46:49] [INFO ] After 15318ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 128 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 129 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:46:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:46:49] [INFO ] Invariant cache hit.
[2023-03-18 10:46:50] [INFO ] Implicit Places using invariants in 951 ms returned []
Implicit Place search using SMT only with invariants took 954 ms to find 0 implicit places.
[2023-03-18 10:46:50] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:46:50] [INFO ] Invariant cache hit.
[2023-03-18 10:46:59] [INFO ] Dead Transitions using invariants and state equation in 8230 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9316 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
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 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1201 transitions
Redundant transition composition rules discarded 1201 transitions
Iterating global reduction 3 with 1201 rules applied. Total rules applied 1259 place count 165 transition count 1060
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1235 edges and 163 vertex of which 146 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1270 place count 146 transition count 1050
Drop transitions removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 4 with 107 rules applied. Total rules applied 1377 place count 146 transition count 943
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 1380 place count 143 transition count 932
Iterating global reduction 5 with 3 rules applied. Total rules applied 1383 place count 143 transition count 932
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1384 place count 143 transition count 931
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1385 place count 142 transition count 929
Iterating global reduction 6 with 1 rules applied. Total rules applied 1386 place count 142 transition count 929
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 6 with 2 rules applied. Total rules applied 1388 place count 141 transition count 928
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1393 place count 141 transition count 923
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1405 place count 141 transition count 904
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1437 place count 129 transition count 884
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1438 place count 128 transition count 882
Iterating global reduction 7 with 1 rules applied. Total rules applied 1439 place count 128 transition count 882
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1447 place count 128 transition count 874
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1505 place count 128 transition count 816
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1511 place count 128 transition count 810
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1521 place count 122 transition count 806
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1527 place count 122 transition count 800
Free-agglomeration rule applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1528 place count 122 transition count 799
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1531 place count 121 transition count 797
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1533 place count 121 transition count 795
Free-agglomeration rule applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1534 place count 121 transition count 794
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 1537 place count 120 transition count 792
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1539 place count 120 transition count 790
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1544 place count 120 transition count 874
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1565 place count 115 transition count 858
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1566 place count 114 transition count 854
Iterating global reduction 12 with 1 rules applied. Total rules applied 1567 place count 114 transition count 854
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1576 place count 114 transition count 845
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1595 place count 114 transition count 826
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 13 with 5 rules applied. Total rules applied 1600 place count 114 transition count 826
Applied a total of 1600 rules in 225 ms. Remains 114 /497 variables (removed 383) and now considering 826/27456 (removed 26630) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:46:59] [INFO ] Flow matrix only has 791 transitions (discarded 35 similar events)
// Phase 1: matrix 791 rows 114 cols
[2023-03-18 10:46:59] [INFO ] Computed 0 place invariants in 7 ms
[2023-03-18 10:46:59] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:46:59] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:59] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:46:59] [INFO ] After 19ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:46:59] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-18 10:46:59] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40499 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40499 steps, saw 28663 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:47:02] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:47:02] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-18 10:47:03] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:47:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:47:06] [INFO ] After 3449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:47:06] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:47:14] [INFO ] After 7485ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:47:17] [INFO ] Deduced a trap composed of 49 places in 2136 ms of which 1 ms to minimize.
[2023-03-18 10:47:19] [INFO ] Deduced a trap composed of 84 places in 1900 ms of which 0 ms to minimize.
[2023-03-18 10:47:21] [INFO ] Deduced a trap composed of 51 places in 1582 ms of which 1 ms to minimize.
[2023-03-18 10:47:25] [INFO ] Deduced a trap composed of 58 places in 1927 ms of which 0 ms to minimize.
[2023-03-18 10:47:27] [INFO ] Deduced a trap composed of 26 places in 1949 ms of which 1 ms to minimize.
[2023-03-18 10:47:30] [INFO ] Deduced a trap composed of 12 places in 2178 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:47:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:47:30] [INFO ] After 27216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 462 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 205 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 40808 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 40808 steps, saw 28875 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:47:34] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:47:34] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:47:34] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:47:34] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:47:37] [INFO ] After 3604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:47:37] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:47:47] [INFO ] After 9852ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:47:52] [INFO ] Deduced a trap composed of 49 places in 2038 ms of which 0 ms to minimize.
[2023-03-18 10:47:54] [INFO ] Deduced a trap composed of 79 places in 1685 ms of which 1 ms to minimize.
[2023-03-18 10:47:56] [INFO ] Deduced a trap composed of 60 places in 1388 ms of which 0 ms to minimize.
[2023-03-18 10:47:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 6657 ms
[2023-03-18 10:47:56] [INFO ] After 18817ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 731 ms.
[2023-03-18 10:47:57] [INFO ] After 23337ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 115 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:47:57] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:47:57] [INFO ] Invariant cache hit.
[2023-03-18 10:47:58] [INFO ] Implicit Places using invariants in 883 ms returned []
Implicit Place search using SMT only with invariants took 883 ms to find 0 implicit places.
[2023-03-18 10:47:58] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:47:58] [INFO ] Invariant cache hit.
[2023-03-18 10:48:06] [INFO ] Dead Transitions using invariants and state equation in 7596 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8585 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 379 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 317 places
Drop transitions removed 11151 transitions
Ensure Unique test removed 13967 transitions
Reduce isomorphic transitions removed 25118 transitions.
Graph (complete) has 2352 edges and 180 vertex of which 172 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 172 transition count 2324
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 170 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 169 transition count 2314
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 169 transition count 2314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 167 transition count 2312
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 167 transition count 2279
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 166 transition count 2289
Drop transitions removed 1214 transitions
Redundant transition composition rules discarded 1214 transitions
Iterating global reduction 3 with 1214 rules applied. Total rules applied 1273 place count 166 transition count 1075
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1238 edges and 164 vertex of which 146 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1284 place count 146 transition count 1064
Drop transitions removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 4 with 112 rules applied. Total rules applied 1396 place count 146 transition count 952
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1398 place count 144 transition count 942
Iterating global reduction 5 with 2 rules applied. Total rules applied 1400 place count 144 transition count 942
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1401 place count 144 transition count 941
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 6 with 2 rules applied. Total rules applied 1403 place count 143 transition count 940
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1408 place count 143 transition count 935
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1420 place count 143 transition count 916
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1452 place count 131 transition count 896
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1453 place count 130 transition count 894
Iterating global reduction 7 with 1 rules applied. Total rules applied 1454 place count 130 transition count 894
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1462 place count 130 transition count 886
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1520 place count 130 transition count 828
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1526 place count 130 transition count 822
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1536 place count 124 transition count 818
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1542 place count 124 transition count 812
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1544 place count 124 transition count 810
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1548 place count 122 transition count 808
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1552 place count 122 transition count 804
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1554 place count 122 transition count 802
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1558 place count 120 transition count 800
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1560 place count 120 transition count 798
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1565 place count 120 transition count 885
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1586 place count 115 transition count 869
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1587 place count 114 transition count 865
Iterating global reduction 12 with 1 rules applied. Total rules applied 1588 place count 114 transition count 865
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1597 place count 114 transition count 856
Drop transitions removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 13 with 20 rules applied. Total rules applied 1617 place count 114 transition count 836
Applied a total of 1617 rules in 217 ms. Remains 114 /497 variables (removed 383) and now considering 836/27456 (removed 26620) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:48:06] [INFO ] Flow matrix only has 794 transitions (discarded 42 similar events)
// Phase 1: matrix 794 rows 114 cols
[2023-03-18 10:48:06] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 10:48:06] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:48:06] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:48:06] [INFO ] After 21ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:06] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 10:48:06] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41790 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41790 steps, saw 29514 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:48:09] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:48:10] [INFO ] Computed 8 place invariants in 54 ms
[2023-03-18 10:48:10] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:48:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:48:13] [INFO ] After 3391ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:13] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:48:18] [INFO ] After 4427ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:19] [INFO ] After 5383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 401 ms.
[2023-03-18 10:48:19] [INFO ] After 9416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 446 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41170 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41170 steps, saw 29109 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:48:23] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:48:23] [INFO ] Computed 8 place invariants in 56 ms
[2023-03-18 10:48:23] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:48:23] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:48:27] [INFO ] After 3610ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:27] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:48:31] [INFO ] After 4667ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:34] [INFO ] Deduced a trap composed of 47 places in 2130 ms of which 1 ms to minimize.
[2023-03-18 10:48:37] [INFO ] Deduced a trap composed of 51 places in 2032 ms of which 0 ms to minimize.
[2023-03-18 10:48:39] [INFO ] Deduced a trap composed of 19 places in 1980 ms of which 0 ms to minimize.
[2023-03-18 10:48:41] [INFO ] Deduced a trap composed of 72 places in 2006 ms of which 1 ms to minimize.
[2023-03-18 10:48:44] [INFO ] Deduced a trap composed of 185 places in 1892 ms of which 1 ms to minimize.
[2023-03-18 10:48:46] [INFO ] Deduced a trap composed of 49 places in 1770 ms of which 1 ms to minimize.
[2023-03-18 10:48:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 15073 ms
[2023-03-18 10:48:47] [INFO ] After 20467ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 466 ms.
[2023-03-18 10:48:48] [INFO ] After 24731ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 102 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:48:48] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:48:48] [INFO ] Invariant cache hit.
[2023-03-18 10:48:49] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 893 ms to find 0 implicit places.
[2023-03-18 10:48:49] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:48:49] [INFO ] Invariant cache hit.
[2023-03-18 10:48:56] [INFO ] Dead Transitions using invariants and state equation in 7498 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8496 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10360 edges and 497 vertex of which 381 / 497 are part of one of the 62 SCC in 2 ms
Free SCC test removed 319 places
Drop transitions removed 11224 transitions
Ensure Unique test removed 13923 transitions
Reduce isomorphic transitions removed 25147 transitions.
Graph (complete) has 2322 edges and 178 vertex of which 171 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 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 13 rules applied. Total rules applied 15 place count 171 transition count 2296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 169 transition count 2296
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 18 place count 168 transition count 2286
Iterating global reduction 2 with 1 rules applied. Total rules applied 19 place count 168 transition count 2286
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 2 with 4 rules applied. Total rules applied 23 place count 166 transition count 2284
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 56 place count 166 transition count 2251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 165 transition count 2261
Drop transitions removed 1200 transitions
Redundant transition composition rules discarded 1200 transitions
Iterating global reduction 3 with 1200 rules applied. Total rules applied 1258 place count 165 transition count 1061
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1228 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.0 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1269 place count 144 transition count 1050
Drop transitions removed 113 transitions
Reduce isomorphic transitions removed 113 transitions.
Iterating post reduction 4 with 113 rules applied. Total rules applied 1382 place count 144 transition count 937
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1384 place count 142 transition count 927
Iterating global reduction 5 with 2 rules applied. Total rules applied 1386 place count 142 transition count 927
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1387 place count 142 transition count 926
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 6 with 2 rules applied. Total rules applied 1389 place count 141 transition count 925
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1394 place count 141 transition count 920
Free-agglomeration rule applied 12 times with reduction of 7 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1406 place count 141 transition count 901
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1438 place count 129 transition count 881
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1439 place count 128 transition count 879
Iterating global reduction 7 with 1 rules applied. Total rules applied 1440 place count 128 transition count 879
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1448 place count 128 transition count 871
Drop transitions removed 58 transitions
Redundant transition composition rules discarded 58 transitions
Iterating global reduction 8 with 58 rules applied. Total rules applied 1506 place count 128 transition count 813
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1512 place count 128 transition count 807
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1522 place count 122 transition count 803
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1528 place count 122 transition count 797
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1530 place count 122 transition count 795
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1534 place count 120 transition count 793
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1538 place count 120 transition count 789
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1540 place count 120 transition count 787
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1544 place count 118 transition count 785
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1546 place count 118 transition count 783
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 1551 place count 118 transition count 867
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 11 with 21 rules applied. Total rules applied 1572 place count 113 transition count 851
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1573 place count 112 transition count 847
Iterating global reduction 12 with 1 rules applied. Total rules applied 1574 place count 112 transition count 847
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1583 place count 112 transition count 838
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1602 place count 112 transition count 819
Applied a total of 1602 rules in 196 ms. Remains 112 /497 variables (removed 385) and now considering 819/27456 (removed 26637) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:48:56] [INFO ] Flow matrix only has 781 transitions (discarded 38 similar events)
// Phase 1: matrix 781 rows 112 cols
[2023-03-18 10:48:56] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-18 10:48:57] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:48:57] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:57] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-18 10:48:57] [INFO ] After 22ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:48:57] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 10:48:57] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41602 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41602 steps, saw 29392 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:49:00] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:49:00] [INFO ] Computed 8 place invariants in 57 ms
[2023-03-18 10:49:00] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:49:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:49:04] [INFO ] After 3417ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:49:04] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:49:10] [INFO ] After 5778ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:49:12] [INFO ] Deduced a trap composed of 11 places in 1691 ms of which 0 ms to minimize.
[2023-03-18 10:49:14] [INFO ] Deduced a trap composed of 60 places in 1692 ms of which 0 ms to minimize.
[2023-03-18 10:49:16] [INFO ] Deduced a trap composed of 19 places in 1619 ms of which 1 ms to minimize.
[2023-03-18 10:49:18] [INFO ] Deduced a trap composed of 149 places in 1633 ms of which 0 ms to minimize.
[2023-03-18 10:49:20] [INFO ] Deduced a trap composed of 91 places in 1621 ms of which 1 ms to minimize.
[2023-03-18 10:49:22] [INFO ] Deduced a trap composed of 84 places in 1652 ms of which 1 ms to minimize.
[2023-03-18 10:49:24] [INFO ] Deduced a trap composed of 47 places in 1596 ms of which 1 ms to minimize.
[2023-03-18 10:49:26] [INFO ] Deduced a trap composed of 101 places in 1405 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:49:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:49:26] [INFO ] After 25808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 444 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 41351 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41351 steps, saw 29226 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:49:30] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:49:30] [INFO ] Computed 8 place invariants in 55 ms
[2023-03-18 10:49:30] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:49:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:49:33] [INFO ] After 3519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:49:34] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:49:40] [INFO ] After 6585ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:49:43] [INFO ] Deduced a trap composed of 19 places in 1585 ms of which 1 ms to minimize.
[2023-03-18 10:49:45] [INFO ] Deduced a trap composed of 157 places in 1642 ms of which 1 ms to minimize.
[2023-03-18 10:49:47] [INFO ] Deduced a trap composed of 51 places in 1644 ms of which 1 ms to minimize.
[2023-03-18 10:49:49] [INFO ] Deduced a trap composed of 91 places in 1461 ms of which 0 ms to minimize.
[2023-03-18 10:49:50] [INFO ] Deduced a trap composed of 12 places in 1396 ms of which 0 ms to minimize.
[2023-03-18 10:49:52] [INFO ] Deduced a trap composed of 11 places in 1491 ms of which 0 ms to minimize.
[2023-03-18 10:49:54] [INFO ] Deduced a trap composed of 32 places in 1712 ms of which 0 ms to minimize.
[2023-03-18 10:49:55] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 13838 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:49:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:49:55] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 7 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 104 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 105 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:49:55] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:49:55] [INFO ] Invariant cache hit.
[2023-03-18 10:49:56] [INFO ] Implicit Places using invariants in 936 ms returned []
Implicit Place search using SMT only with invariants took 937 ms to find 0 implicit places.
[2023-03-18 10:49:56] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:49:56] [INFO ] Invariant cache hit.
[2023-03-18 10:50:04] [INFO ] Dead Transitions using invariants and state equation in 7937 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8986 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10326 edges and 497 vertex of which 380 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 318 places
Drop transitions removed 11175 transitions
Ensure Unique test removed 13875 transitions
Reduce isomorphic transitions removed 25050 transitions.
Graph (complete) has 2351 edges and 179 vertex of which 171 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 171 transition count 2392
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 169 transition count 2392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 168 transition count 2382
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 168 transition count 2382
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 2 with 4 rules applied. Total rules applied 24 place count 166 transition count 2380
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 166 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 165 transition count 2357
Drop transitions removed 1273 transitions
Redundant transition composition rules discarded 1273 transitions
Iterating global reduction 3 with 1273 rules applied. Total rules applied 1332 place count 165 transition count 1084
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1261 edges and 163 vertex of which 145 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.0 ms
Discarding 18 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1343 place count 145 transition count 1073
Drop transitions removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 4 with 86 rules applied. Total rules applied 1429 place count 145 transition count 987
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1430 place count 144 transition count 982
Iterating global reduction 5 with 1 rules applied. Total rules applied 1431 place count 144 transition count 982
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 5 with 2 rules applied. Total rules applied 1433 place count 143 transition count 981
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1435 place count 143 transition count 979
Free-agglomeration rule applied 11 times with reduction of 7 identical transitions.
Iterating global reduction 5 with 11 rules applied. Total rules applied 1446 place count 143 transition count 961
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 1477 place count 132 transition count 941
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1478 place count 131 transition count 939
Iterating global reduction 6 with 1 rules applied. Total rules applied 1479 place count 131 transition count 939
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1487 place count 131 transition count 931
Drop transitions removed 50 transitions
Redundant transition composition rules discarded 50 transitions
Iterating global reduction 7 with 50 rules applied. Total rules applied 1537 place count 131 transition count 881
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1543 place count 131 transition count 875
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 1553 place count 125 transition count 871
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1559 place count 125 transition count 865
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1561 place count 125 transition count 863
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 1565 place count 123 transition count 861
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 1569 place count 123 transition count 857
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1571 place count 123 transition count 855
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1575 place count 121 transition count 853
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1577 place count 121 transition count 851
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 1581 place count 121 transition count 945
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 10 with 19 rules applied. Total rules applied 1600 place count 117 transition count 930
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 1601 place count 116 transition count 926
Iterating global reduction 11 with 1 rules applied. Total rules applied 1602 place count 116 transition count 926
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 1603 place count 116 transition count 925
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 12 with 21 rules applied. Total rules applied 1624 place count 116 transition count 904
Applied a total of 1624 rules in 248 ms. Remains 116 /497 variables (removed 381) and now considering 904/27456 (removed 26552) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:50:04] [INFO ] Flow matrix only has 864 transitions (discarded 40 similar events)
// Phase 1: matrix 864 rows 116 cols
[2023-03-18 10:50:04] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-18 10:50:04] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:50:04] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:04] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-18 10:50:04] [INFO ] After 29ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:05] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-18 10:50:05] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 39715 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 39715 steps, saw 28126 distinct states, run finished after 3003 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:50:08] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:50:08] [INFO ] Computed 8 place invariants in 59 ms
[2023-03-18 10:50:08] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:50:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-18 10:50:12] [INFO ] After 3932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:12] [INFO ] State equation strengthened by 1370 read => feed constraints.
[2023-03-18 10:50:20] [INFO ] After 7923ms SMT Verify possible using 1370 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:23] [INFO ] Deduced a trap composed of 101 places in 1491 ms of which 1 ms to minimize.
[2023-03-18 10:50:29] [INFO ] Deduced a trap composed of 92 places in 1299 ms of which 1 ms to minimize.
[2023-03-18 10:50:31] [INFO ] Deduced a trap composed of 51 places in 1823 ms of which 1 ms to minimize.
[2023-03-18 10:50:33] [INFO ] Deduced a trap composed of 49 places in 1561 ms of which 1 ms to minimize.
[2023-03-18 10:50:36] [INFO ] Deduced a trap composed of 12 places in 2382 ms of which 1 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:50:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:50:36] [INFO ] After 27410ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 27270/27270 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 502 transition count 27269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 501 transition count 27280
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 501 transition count 27277
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 11 place count 498 transition count 27276
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 498 transition count 27456
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 497 transition count 27456
Applied a total of 13 rules in 440 ms. Remains 497 /503 variables (removed 6) and now considering 27456/27270 (removed -186) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 442 ms. Remains : 497/503 places, 27456/27270 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41411 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41411 steps, saw 29265 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:50:39] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
// Phase 1: matrix 18727 rows 497 cols
[2023-03-18 10:50:39] [INFO ] Computed 8 place invariants in 58 ms
[2023-03-18 10:50:39] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:50:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-18 10:50:44] [INFO ] After 4047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:44] [INFO ] State equation strengthened by 1374 read => feed constraints.
[2023-03-18 10:50:49] [INFO ] After 5436ms SMT Verify possible using 1374 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:50:53] [INFO ] Deduced a trap composed of 51 places in 1696 ms of which 1 ms to minimize.
[2023-03-18 10:50:54] [INFO ] Deduced a trap composed of 92 places in 1033 ms of which 0 ms to minimize.
[2023-03-18 10:50:56] [INFO ] Deduced a trap composed of 49 places in 1377 ms of which 1 ms to minimize.
[2023-03-18 10:50:58] [INFO ] Deduced a trap composed of 101 places in 1613 ms of which 1 ms to minimize.
[2023-03-18 10:51:00] [INFO ] Deduced a trap composed of 79 places in 1774 ms of which 0 ms to minimize.
[2023-03-18 10:51:03] [INFO ] Deduced a trap composed of 147 places in 1699 ms of which 1 ms to minimize.
[2023-03-18 10:51:06] [INFO ] Deduced a trap composed of 47 places in 1813 ms of which 0 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:412)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
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-18 10:51:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 10:51:06] [INFO ] After 26269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 497 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 497/497 places, 27456/27456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 497/497 places, 27456/27456 transitions.
Applied a total of 0 rules in 99 ms. Remains 497 /497 variables (removed 0) and now considering 27456/27456 (removed 0) transitions.
[2023-03-18 10:51:06] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:51:06] [INFO ] Invariant cache hit.
[2023-03-18 10:51:07] [INFO ] Implicit Places using invariants in 877 ms returned []
Implicit Place search using SMT only with invariants took 878 ms to find 0 implicit places.
[2023-03-18 10:51:07] [INFO ] Flow matrix only has 18727 transitions (discarded 8729 similar events)
[2023-03-18 10:51:07] [INFO ] Invariant cache hit.
[2023-03-18 10:51:14] [INFO ] Dead Transitions using invariants and state equation in 7448 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8427 ms. Remains : 497/497 places, 27456/27456 transitions.
Graph (trivial) has 10331 edges and 497 vertex of which 380 / 497 are part of one of the 62 SCC in 1 ms
Free SCC test removed 318 places
Drop transitions removed 11186 transitions
Ensure Unique test removed 13885 transitions
Reduce isomorphic transitions removed 25071 transitions.
Graph (complete) has 2394 edges and 179 vertex of which 171 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 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 14 rules applied. Total rules applied 16 place count 171 transition count 2371
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 169 transition count 2371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 168 transition count 2360
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 168 transition count 2360
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 2 with 4 rules applied. Total rules applied 24 place count 166 transition count 2358
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 2 with 33 rules applied. Total rules applied 57 place count 166 transition count 2325
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 165 transition count 2335
Drop transitions removed 1251 transitions
Redundant transition composition rules discarded 1251 transitions
Iterating global reduction 3 with 1251 rules applied. Total rules applied 1310 place count 165 transition count 1084
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1250 edges and 163 vertex of which 144 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 3 with 11 rules applied. Total rules applied 1321 place count 144 transition count 1073
Drop transitions removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Iterating post reduction 4 with 115 rules applied. Total rules applied 1436 place count 144 transition count 958
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1438 place count 142 transition count 948
Iterating global reduction 5 with 2 rules applied. Total rules applied 1440 place count 142 transition count 948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1441 place count 142 transition count 947
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 6 with 2 rules applied. Total rules applied 1443 place count 141 transition count 946
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1448 place count 141 transition count 941
Free-agglomeration rule applied 12 times with reduction of 8 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1460 place count 141 transition count 921
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1492 place count 129 transition count 901
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1493 place count 128 transition count 899
Iterating global reduction 7 with 1 rules applied. Total rules applied 1494 place count 128 transition count 899
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1502 place count 128 transition count 891
Drop transitions removed 61 transitions
Redundant transition composition rules discarded 61 transitions
Iterating global reduction 8 with 61 rules applied. Total rules applied 1563 place count 128 transition count 830
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1569 place count 128 transition count 824
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1579 place count 122 transition count 820
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1585 place count 122 transition count 814
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1587 place count 122 transition count 812
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 1591 place count 120 transition count 810
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 10 with 4 rules applied. Total rules applied 1595 place count 120 transition count 806
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1597 place count 120 transition count 804
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 1601 place count 118 transition count 802
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1603 place count 118 transition count 800
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 11 with 4 rules applied. Total rules applied 1607 place count 118 transition count 874
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 11 with 9 rules applied. Total rules applied 1616 place count 114 transition count 869
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1617 place count 113 transition count 865
Iterating global reduction 12 with 1 rules applied. Total rules applied 1618 place count 113 transition count 865
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 1627 place count 113 transition count 856
Drop transitions removed 21 transitions
Redundant transition composition rules discarded 21 transitions
Iterating global reduction 13 with 21 rules applied. Total rules applied 1648 place count 113 transition count 835
Applied a total of 1648 rules in 202 ms. Remains 113 /497 variables (removed 384) and now considering 835/27456 (removed 26621) transitions.
Running SMT prover for 1 properties.
[2023-03-18 10:51:14] [INFO ] Flow matrix only has 798 transitions (discarded 37 similar events)
// Phase 1: matrix 798 rows 113 cols
[2023-03-18 10:51:14] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-18 10:51:14] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:51:15] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:51:15] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-18 10:51:15] [INFO ] After 25ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 10:51:15] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-18 10:51:15] [INFO ] After 243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 41540 steps, run timeout after 3001 ms. (steps per millisecond=13 ) properties seen :{}
Probabilistic random walk after 41540 steps, saw 29352 distinct states, run finished after 3001 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 10:51:18] [INFO ] Flow matrix only has 18593 transitions (discarded 8677 similar events)
// Phase 1: matrix 18593 rows 503 cols
[2023-03-18 10:51:18] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-18 10:51:18] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 10:51:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-18 10:51:22] [INFO ] After 3479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 10:51:22] [INFO ] State equation strengthened by 1370 read => feed constraints.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393232 kB
MemFree: 13913704 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16104304 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 StableMarking -timeout 180 -rebuildPNML

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="RERS2020-PT-pb103"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 RERS2020-PT-pb103, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r344-tall-167889215900148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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