About the Execution of Marcie+red for RERS17pb114-PT-3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12698.268 | 3600000.00 | 4025086.00 | 7170.70 | [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.r330-tall-167889202800090.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 RERS17pb114-PT-3, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889202800090
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 7.9K Feb 26 04:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 04:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 04:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 04:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 26 04:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M 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
here is the order used to build the result vector(from text file)
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-00
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-01
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-02
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-03
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-04
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-05
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-06
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-07
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-08
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-09
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-10
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-11
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-12
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-13
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-14
FORMULA_NAME RERS17pb114-PT-3-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679043632329
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-3
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 09:00:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:00:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:00:36] [INFO ] Load time of PNML (sax parser for PT used): 1900 ms
[2023-03-17 09:00:36] [INFO ] Transformed 1446 places.
[2023-03-17 09:00:36] [INFO ] Transformed 151085 transitions.
[2023-03-17 09:00:36] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2466 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 34 ms.
Support contains 183 out of 1446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1429 transition count 151085
Applied a total of 17 rules in 990 ms. Remains 1429 /1446 variables (removed 17) and now considering 151085/151085 (removed 0) transitions.
[2023-03-17 09:00:38] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-17 09:00:39] [INFO ] Computed 18 place invariants in 473 ms
[2023-03-17 09:00:47] [INFO ] Implicit Places using invariants in 8409 ms returned []
Implicit Place search using SMT only with invariants took 8434 ms to find 0 implicit places.
[2023-03-17 09:00:47] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 09:00:47] [INFO ] Invariant cache hit.
[2023-03-17 09:01:17] [INFO ] Performed 96076/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:01:33] [INFO ] Dead Transitions using invariants and state equation in 46940 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1429/1446 places, 151085/151085 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56383 ms. Remains : 1429/1446 places, 151085/151085 transitions.
Support contains 183 out of 1429 places after structural reductions.
[2023-03-17 09:01:38] [INFO ] Flatten gal took : 3472 ms
[2023-03-17 09:01:41] [INFO ] Flatten gal took : 3379 ms
[2023-03-17 09:01:49] [INFO ] Input system was already deterministic with 151085 transitions.
Support contains 176 out of 1429 places (down from 183) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1572 ms. (steps per millisecond=6 ) properties (out of 68) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 63) seen :0
Interrupted probabilistic random walk after 8497 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8497 steps, saw 6998 distinct states, run finished after 6010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 63 properties.
[2023-03-17 09:01:59] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-17 09:01:59] [INFO ] Invariant cache hit.
[2023-03-17 09:02:01] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 09:02:24] [INFO ] After 22949ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39 real:24
[2023-03-17 09:02:27] [INFO ] State equation strengthened by 2342 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:339)
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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 09:02:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:02:27] [INFO ] After 27742ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 63 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 165 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1429 transition count 150573
Applied a total of 512 rules in 1758 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1778 ms. Remains : 1429/1429 places, 150573/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1430 ms. (steps per millisecond=6 ) properties (out of 63) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=33 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 60) seen :0
Interrupted probabilistic random walk after 8825 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8825 steps, saw 7981 distinct states, run finished after 6004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 60 properties.
[2023-03-17 09:02:38] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2023-03-17 09:02:38] [INFO ] Computed 18 place invariants in 303 ms
[2023-03-17 09:02:39] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 09:03:03] [INFO ] After 22768ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39 real:21
[2023-03-17 09:03:05] [INFO ] State equation strengthened by 2341 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:339)
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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 09:03:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:03:05] [INFO ] After 26662ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 157 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1104 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 1429/1429 places, 150573/150573 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1229 ms. (steps per millisecond=8 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 60) seen :0
Interrupted probabilistic random walk after 8433 steps, run timeout after 6004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8433 steps, saw 7617 distinct states, run finished after 6004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 60 properties.
[2023-03-17 09:03:14] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-17 09:03:14] [INFO ] Invariant cache hit.
[2023-03-17 09:03:16] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 09:03:40] [INFO ] After 22976ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39 real:21
[2023-03-17 09:03:41] [INFO ] State equation strengthened by 2341 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:339)
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.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
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-17 09:03:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:03:41] [INFO ] After 26669ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 157 out of 1429 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1256 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1256 ms. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1169 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2023-03-17 09:03:44] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-17 09:03:44] [INFO ] Invariant cache hit.
[2023-03-17 09:03:51] [INFO ] Implicit Places using invariants in 7176 ms returned []
Implicit Place search using SMT only with invariants took 7178 ms to find 0 implicit places.
[2023-03-17 09:03:51] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-17 09:03:51] [INFO ] Invariant cache hit.
[2023-03-17 09:04:21] [INFO ] Performed 99226/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:04:36] [INFO ] Dead Transitions using invariants and state equation in 45676 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54041 ms. Remains : 1429/1429 places, 150573/150573 transitions.
[2023-03-17 09:04:40] [INFO ] Flatten gal took : 2839 ms
[2023-03-17 09:04:43] [INFO ] Flatten gal took : 3174 ms
[2023-03-17 09:04:49] [INFO ] Input system was already deterministic with 151085 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 619 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:04:54] [INFO ] Flatten gal took : 2888 ms
[2023-03-17 09:04:57] [INFO ] Flatten gal took : 3618 ms
[2023-03-17 09:05:04] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 613 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:05:08] [INFO ] Flatten gal took : 2879 ms
[2023-03-17 09:05:11] [INFO ] Flatten gal took : 3320 ms
[2023-03-17 09:05:18] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 622 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:05:22] [INFO ] Flatten gal took : 2907 ms
[2023-03-17 09:05:25] [INFO ] Flatten gal took : 3387 ms
[2023-03-17 09:05:32] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1184 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1187 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-17 09:05:37] [INFO ] Flatten gal took : 3249 ms
[2023-03-17 09:05:40] [INFO ] Flatten gal took : 3510 ms
[2023-03-17 09:05:47] [INFO ] Input system was already deterministic with 151084 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1072 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1076 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-17 09:05:51] [INFO ] Flatten gal took : 3170 ms
[2023-03-17 09:05:55] [INFO ] Flatten gal took : 3657 ms
[2023-03-17 09:06:02] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 833 ms. (steps per millisecond=12 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 5056 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 5056 steps, saw 4074 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:06:06] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 09:06:06] [INFO ] Computed 18 place invariants in 304 ms
[2023-03-17 09:06:06] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 09:06:27] [INFO ] After 20682ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:06:28] [INFO ] State equation strengthened by 773 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-17 09:06:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:06:31] [INFO ] After 25034ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1428 transition count 150572
Applied a total of 512 rules in 1334 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/151084 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1338 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Interrupted random walk after 313793 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Interrupted Best-First random walk after 965224 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 0
Interrupted probabilistic random walk after 199922 steps, run timeout after 105005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 199922 steps, saw 184284 distinct states, run finished after 105005 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:08:53] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 09:08:53] [INFO ] Computed 18 place invariants in 289 ms
[2023-03-17 09:08:54] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:09:14] [INFO ] After 20428ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:09:15] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:09:21] [INFO ] After 6436ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:09:33] [INFO ] Deduced a trap composed of 40 places in 10535 ms of which 17 ms to minimize.
[2023-03-17 09:09:44] [INFO ] Deduced a trap composed of 40 places in 10402 ms of which 2 ms to minimize.
[2023-03-17 09:09:56] [INFO ] Deduced a trap composed of 64 places in 10229 ms of which 2 ms to minimize.
[2023-03-17 09:10:07] [INFO ] Deduced a trap composed of 64 places in 9900 ms of which 3 ms to minimize.
[2023-03-17 09:10:17] [INFO ] Deduced a trap composed of 64 places in 9695 ms of which 4 ms to minimize.
[2023-03-17 09:10:28] [INFO ] Deduced a trap composed of 64 places in 9269 ms of which 1 ms to minimize.
[2023-03-17 09:10:38] [INFO ] Deduced a trap composed of 96 places in 8919 ms of which 1 ms to minimize.
[2023-03-17 09:10:47] [INFO ] Deduced a trap composed of 128 places in 8267 ms of which 1 ms to minimize.
[2023-03-17 09:10:56] [INFO ] Deduced a trap composed of 96 places in 7501 ms of which 0 ms to minimize.
[2023-03-17 09:11:05] [INFO ] Deduced a trap composed of 64 places in 7519 ms of which 1 ms to minimize.
[2023-03-17 09:11:13] [INFO ] Deduced a trap composed of 96 places in 7299 ms of which 1 ms to minimize.
[2023-03-17 09:11:20] [INFO ] Deduced a trap composed of 64 places in 5993 ms of which 0 ms to minimize.
[2023-03-17 09:11:27] [INFO ] Deduced a trap composed of 96 places in 5277 ms of which 0 ms to minimize.
[2023-03-17 09:11:32] [INFO ] Deduced a trap composed of 128 places in 4682 ms of which 1 ms to minimize.
[2023-03-17 09:11:37] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 135584 ms
[2023-03-17 09:11:37] [INFO ] After 142799ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:11:37] [INFO ] After 164046ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:11:38] [INFO ] [Nat]Absence check using 18 positive place invariants in 21 ms returned sat
[2023-03-17 09:11:59] [INFO ] After 21337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:12:06] [INFO ] After 7066ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:12:18] [INFO ] Deduced a trap composed of 40 places in 10643 ms of which 2 ms to minimize.
[2023-03-17 09:12:29] [INFO ] Deduced a trap composed of 40 places in 10441 ms of which 2 ms to minimize.
[2023-03-17 09:12:40] [INFO ] Deduced a trap composed of 64 places in 9985 ms of which 2 ms to minimize.
[2023-03-17 09:12:52] [INFO ] Deduced a trap composed of 64 places in 10629 ms of which 1 ms to minimize.
[2023-03-17 09:13:04] [INFO ] Deduced a trap composed of 64 places in 10654 ms of which 2 ms to minimize.
[2023-03-17 09:13:16] [INFO ] Deduced a trap composed of 64 places in 10786 ms of which 7 ms to minimize.
[2023-03-17 09:13:26] [INFO ] Deduced a trap composed of 96 places in 9285 ms of which 1 ms to minimize.
[2023-03-17 09:13:36] [INFO ] Deduced a trap composed of 128 places in 8282 ms of which 1 ms to minimize.
[2023-03-17 09:13:44] [INFO ] Deduced a trap composed of 96 places in 7727 ms of which 1 ms to minimize.
[2023-03-17 09:13:53] [INFO ] Deduced a trap composed of 64 places in 7521 ms of which 1 ms to minimize.
[2023-03-17 09:14:02] [INFO ] Deduced a trap composed of 96 places in 7352 ms of which 1 ms to minimize.
[2023-03-17 09:14:09] [INFO ] Deduced a trap composed of 64 places in 6075 ms of which 0 ms to minimize.
[2023-03-17 09:14:15] [INFO ] Deduced a trap composed of 96 places in 5258 ms of which 0 ms to minimize.
[2023-03-17 09:14:21] [INFO ] Deduced a trap composed of 128 places in 4654 ms of which 0 ms to minimize.
[2023-03-17 09:14:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 138911 ms
[2023-03-17 09:14:26] [INFO ] After 146704ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1154 ms.
[2023-03-17 09:14:27] [INFO ] After 169411ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1076 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1076 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1098 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 09:14:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:14:29] [INFO ] Invariant cache hit.
[2023-03-17 09:14:37] [INFO ] Implicit Places using invariants in 7960 ms returned []
Implicit Place search using SMT only with invariants took 7961 ms to find 0 implicit places.
[2023-03-17 09:14:37] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:14:37] [INFO ] Invariant cache hit.
[2023-03-17 09:15:07] [INFO ] Performed 98443/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:15:23] [INFO ] Dead Transitions using invariants and state equation in 46133 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55204 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 28651 steps, including 0 resets, run visited all 2 properties in 2710 ms. (steps per millisecond=10 )
Interrupted random walk after 319989 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4867 ms. (steps per millisecond=205 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160040 steps, run timeout after 102009 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 160040 steps, saw 147878 distinct states, run finished after 102010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:17:43] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:17:43] [INFO ] Invariant cache hit.
[2023-03-17 09:17:43] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 09:18:04] [INFO ] After 20923ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:18:05] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:18:13] [INFO ] After 7478ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:18:25] [INFO ] Deduced a trap composed of 40 places in 10811 ms of which 2 ms to minimize.
[2023-03-17 09:18:36] [INFO ] Deduced a trap composed of 40 places in 10624 ms of which 2 ms to minimize.
[2023-03-17 09:18:47] [INFO ] Deduced a trap composed of 64 places in 9939 ms of which 2 ms to minimize.
[2023-03-17 09:18:58] [INFO ] Deduced a trap composed of 96 places in 9581 ms of which 1 ms to minimize.
[2023-03-17 09:19:08] [INFO ] Deduced a trap composed of 96 places in 8536 ms of which 1 ms to minimize.
[2023-03-17 09:19:17] [INFO ] Deduced a trap composed of 64 places in 8267 ms of which 5 ms to minimize.
[2023-03-17 09:19:27] [INFO ] Deduced a trap composed of 64 places in 8080 ms of which 1 ms to minimize.
[2023-03-17 09:19:36] [INFO ] Deduced a trap composed of 64 places in 8123 ms of which 1 ms to minimize.
[2023-03-17 09:19:45] [INFO ] Deduced a trap composed of 96 places in 7680 ms of which 1 ms to minimize.
[2023-03-17 09:19:53] [INFO ] Deduced a trap composed of 64 places in 7251 ms of which 0 ms to minimize.
[2023-03-17 09:20:02] [INFO ] Deduced a trap composed of 96 places in 7127 ms of which 2 ms to minimize.
[2023-03-17 09:20:10] [INFO ] Deduced a trap composed of 128 places in 6877 ms of which 1 ms to minimize.
[2023-03-17 09:20:17] [INFO ] Deduced a trap composed of 128 places in 6271 ms of which 1 ms to minimize.
[2023-03-17 09:20:24] [INFO ] Deduced a trap composed of 128 places in 5471 ms of which 5 ms to minimize.
[2023-03-17 09:20:28] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 135478 ms
[2023-03-17 09:20:29] [INFO ] After 143755ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:20:29] [INFO ] After 165656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:20:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:20:50] [INFO ] After 21071ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:20:58] [INFO ] After 7475ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:21:10] [INFO ] Deduced a trap composed of 40 places in 11175 ms of which 2 ms to minimize.
[2023-03-17 09:21:22] [INFO ] Deduced a trap composed of 40 places in 10602 ms of which 1 ms to minimize.
[2023-03-17 09:21:33] [INFO ] Deduced a trap composed of 64 places in 10187 ms of which 1 ms to minimize.
[2023-03-17 09:21:43] [INFO ] Deduced a trap composed of 96 places in 9178 ms of which 1 ms to minimize.
[2023-03-17 09:21:53] [INFO ] Deduced a trap composed of 96 places in 8633 ms of which 2 ms to minimize.
[2023-03-17 09:22:02] [INFO ] Deduced a trap composed of 64 places in 8280 ms of which 1 ms to minimize.
[2023-03-17 09:22:11] [INFO ] Deduced a trap composed of 64 places in 8061 ms of which 1 ms to minimize.
[2023-03-17 09:22:20] [INFO ] Deduced a trap composed of 64 places in 7998 ms of which 2 ms to minimize.
[2023-03-17 09:22:29] [INFO ] Deduced a trap composed of 96 places in 7799 ms of which 1 ms to minimize.
[2023-03-17 09:22:37] [INFO ] Deduced a trap composed of 64 places in 7071 ms of which 1 ms to minimize.
[2023-03-17 09:22:45] [INFO ] Deduced a trap composed of 96 places in 6912 ms of which 1 ms to minimize.
[2023-03-17 09:22:53] [INFO ] Deduced a trap composed of 128 places in 6778 ms of which 0 ms to minimize.
[2023-03-17 09:23:01] [INFO ] Deduced a trap composed of 128 places in 6650 ms of which 3 ms to minimize.
[2023-03-17 09:23:08] [INFO ] Deduced a trap composed of 128 places in 5419 ms of which 1 ms to minimize.
[2023-03-17 09:23:12] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 134286 ms
[2023-03-17 09:23:13] [INFO ] After 142492ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1117 ms.
[2023-03-17 09:23:14] [INFO ] After 164851ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1177 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1178 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1184 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 09:23:16] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:23:16] [INFO ] Invariant cache hit.
[2023-03-17 09:23:25] [INFO ] Implicit Places using invariants in 8637 ms returned []
Implicit Place search using SMT only with invariants took 8638 ms to find 0 implicit places.
[2023-03-17 09:23:25] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:23:25] [INFO ] Invariant cache hit.
[2023-03-17 09:23:55] [INFO ] Performed 98066/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:24:11] [INFO ] Dead Transitions using invariants and state equation in 46242 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56084 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 15025 steps, including 0 resets, run visited all 2 properties in 1420 ms. (steps per millisecond=10 )
Ensure Unique test removed 65883 transitions
Reduce isomorphic transitions removed 65883 transitions.
Iterating post reduction 0 with 65883 rules applied. Total rules applied 65883 place count 1428 transition count 84689
Applied a total of 65883 rules in 2812 ms. Remains 1428 /1428 variables (removed 0) and now considering 84689/150572 (removed 65883) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 09:24:16] [INFO ] Computed 18 place invariants in 283 ms
[2023-03-17 09:24:16] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:24:37] [INFO ] After 20902ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:24:43] [INFO ] Deduced a trap composed of 64 places in 5199 ms of which 1 ms to minimize.
[2023-03-17 09:24:50] [INFO ] Deduced a trap composed of 64 places in 5081 ms of which 1 ms to minimize.
[2023-03-17 09:24:55] [INFO ] Deduced a trap composed of 64 places in 4251 ms of which 1 ms to minimize.
[2023-03-17 09:25:00] [INFO ] Deduced a trap composed of 96 places in 3806 ms of which 1 ms to minimize.
[2023-03-17 09:25:04] [INFO ] Deduced a trap composed of 96 places in 2912 ms of which 0 ms to minimize.
[2023-03-17 09:25:07] [INFO ] Deduced a trap composed of 96 places in 1704 ms of which 2 ms to minimize.
[2023-03-17 09:25:09] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 31665 ms
[2023-03-17 09:25:10] [INFO ] After 53325ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:25:10] [INFO ] After 53497ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:25:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-17 09:25:31] [INFO ] After 21132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:25:37] [INFO ] Deduced a trap composed of 64 places in 5293 ms of which 1 ms to minimize.
[2023-03-17 09:25:43] [INFO ] Deduced a trap composed of 64 places in 4881 ms of which 3 ms to minimize.
[2023-03-17 09:25:48] [INFO ] Deduced a trap composed of 64 places in 4310 ms of which 10 ms to minimize.
[2023-03-17 09:25:53] [INFO ] Deduced a trap composed of 96 places in 3801 ms of which 2 ms to minimize.
[2023-03-17 09:25:57] [INFO ] Deduced a trap composed of 96 places in 2892 ms of which 0 ms to minimize.
[2023-03-17 09:26:00] [INFO ] Deduced a trap composed of 96 places in 1677 ms of which 1 ms to minimize.
[2023-03-17 09:26:02] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 31180 ms
[2023-03-17 09:26:03] [INFO ] After 52997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1088 ms.
[2023-03-17 09:26:04] [INFO ] After 54270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 562 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 565 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:26:08] [INFO ] Flatten gal took : 2884 ms
[2023-03-17 09:26:11] [INFO ] Flatten gal took : 3341 ms
[2023-03-17 09:26:18] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1392 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1396 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-17 09:26:23] [INFO ] Flatten gal took : 3228 ms
[2023-03-17 09:26:27] [INFO ] Flatten gal took : 3671 ms
[2023-03-17 09:26:34] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 930 ms. (steps per millisecond=10 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4047 steps, run timeout after 3006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4047 steps, saw 3219 distinct states, run finished after 3008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:26:39] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 09:26:39] [INFO ] Computed 18 place invariants in 271 ms
[2023-03-17 09:26:39] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 09:27:00] [INFO ] After 21381ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:27:01] [INFO ] State equation strengthened by 773 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-17 09:27:04] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:27:04] [INFO ] After 25032ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1428 transition count 150572
Applied a total of 512 rules in 1427 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/151084 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1431 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Interrupted random walk after 307133 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3631 ms. (steps per millisecond=275 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 186286 steps, run timeout after 99003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 186286 steps, saw 171840 distinct states, run finished after 99003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:29:18] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 09:29:19] [INFO ] Computed 18 place invariants in 264 ms
[2023-03-17 09:29:19] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 09:29:40] [INFO ] After 20904ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:29:40] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:29:47] [INFO ] After 6770ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:29:59] [INFO ] Deduced a trap composed of 40 places in 10489 ms of which 1 ms to minimize.
[2023-03-17 09:30:10] [INFO ] Deduced a trap composed of 96 places in 9562 ms of which 2 ms to minimize.
[2023-03-17 09:30:21] [INFO ] Deduced a trap composed of 64 places in 10206 ms of which 2 ms to minimize.
[2023-03-17 09:30:31] [INFO ] Deduced a trap composed of 64 places in 9332 ms of which 2 ms to minimize.
[2023-03-17 09:30:43] [INFO ] Deduced a trap composed of 40 places in 10556 ms of which 1 ms to minimize.
[2023-03-17 09:30:54] [INFO ] Deduced a trap composed of 64 places in 9076 ms of which 2 ms to minimize.
[2023-03-17 09:31:03] [INFO ] Deduced a trap composed of 96 places in 8749 ms of which 1 ms to minimize.
[2023-03-17 09:31:14] [INFO ] Deduced a trap composed of 64 places in 8947 ms of which 1 ms to minimize.
[2023-03-17 09:31:23] [INFO ] Deduced a trap composed of 128 places in 7950 ms of which 1 ms to minimize.
[2023-03-17 09:31:31] [INFO ] Deduced a trap composed of 64 places in 7316 ms of which 1 ms to minimize.
[2023-03-17 09:31:39] [INFO ] Deduced a trap composed of 96 places in 6619 ms of which 1 ms to minimize.
[2023-03-17 09:31:46] [INFO ] Deduced a trap composed of 96 places in 5651 ms of which 1 ms to minimize.
[2023-03-17 09:31:51] [INFO ] Deduced a trap composed of 64 places in 3709 ms of which 0 ms to minimize.
[2023-03-17 09:31:56] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 128403 ms
[2023-03-17 09:31:56] [INFO ] After 135958ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:31:56] [INFO ] After 157671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:31:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 09:32:18] [INFO ] After 21203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:32:25] [INFO ] After 7242ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:32:36] [INFO ] Deduced a trap composed of 40 places in 9828 ms of which 2 ms to minimize.
[2023-03-17 09:32:47] [INFO ] Deduced a trap composed of 96 places in 9845 ms of which 2 ms to minimize.
[2023-03-17 09:32:57] [INFO ] Deduced a trap composed of 64 places in 9526 ms of which 1 ms to minimize.
[2023-03-17 09:33:08] [INFO ] Deduced a trap composed of 64 places in 9306 ms of which 1 ms to minimize.
[2023-03-17 09:33:18] [INFO ] Deduced a trap composed of 40 places in 8793 ms of which 1 ms to minimize.
[2023-03-17 09:33:27] [INFO ] Deduced a trap composed of 64 places in 8374 ms of which 2 ms to minimize.
[2023-03-17 09:33:37] [INFO ] Deduced a trap composed of 96 places in 8453 ms of which 1 ms to minimize.
[2023-03-17 09:33:46] [INFO ] Deduced a trap composed of 64 places in 7907 ms of which 1 ms to minimize.
[2023-03-17 09:33:55] [INFO ] Deduced a trap composed of 128 places in 7679 ms of which 1 ms to minimize.
[2023-03-17 09:34:03] [INFO ] Deduced a trap composed of 64 places in 7179 ms of which 1 ms to minimize.
[2023-03-17 09:34:10] [INFO ] Deduced a trap composed of 96 places in 6522 ms of which 0 ms to minimize.
[2023-03-17 09:34:17] [INFO ] Deduced a trap composed of 96 places in 5669 ms of which 0 ms to minimize.
[2023-03-17 09:34:23] [INFO ] Deduced a trap composed of 66 places in 4410 ms of which 0 ms to minimize.
[2023-03-17 09:34:28] [INFO ] Deduced a trap composed of 64 places in 3749 ms of which 1 ms to minimize.
[2023-03-17 09:34:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 126918 ms
[2023-03-17 09:34:33] [INFO ] After 134892ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1167 ms.
[2023-03-17 09:34:34] [INFO ] After 157429ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1088 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1088 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1083 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 09:34:36] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:34:36] [INFO ] Invariant cache hit.
[2023-03-17 09:34:44] [INFO ] Implicit Places using invariants in 8215 ms returned []
Implicit Place search using SMT only with invariants took 8216 ms to find 0 implicit places.
[2023-03-17 09:34:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:34:44] [INFO ] Invariant cache hit.
[2023-03-17 09:35:14] [INFO ] Performed 95194/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:35:32] [INFO ] Dead Transitions using invariants and state equation in 48151 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57464 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 9987 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-17 09:35:43] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:35:43] [INFO ] Invariant cache hit.
[2023-03-17 09:35:43] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-17 09:36:03] [INFO ] After 19834ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:36:04] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:36:10] [INFO ] After 6074ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:36:22] [INFO ] Deduced a trap composed of 40 places in 11240 ms of which 2 ms to minimize.
[2023-03-17 09:36:34] [INFO ] Deduced a trap composed of 64 places in 10523 ms of which 2 ms to minimize.
[2023-03-17 09:36:45] [INFO ] Deduced a trap composed of 40 places in 10316 ms of which 1 ms to minimize.
[2023-03-17 09:36:56] [INFO ] Deduced a trap composed of 64 places in 9828 ms of which 2 ms to minimize.
[2023-03-17 09:37:06] [INFO ] Deduced a trap composed of 64 places in 8960 ms of which 1 ms to minimize.
[2023-03-17 09:37:17] [INFO ] Deduced a trap composed of 128 places in 9024 ms of which 1 ms to minimize.
[2023-03-17 09:37:26] [INFO ] Deduced a trap composed of 64 places in 8401 ms of which 2 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.Application.startNoEx(Application.java:669)
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-17 09:37:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:37:26] [INFO ] After 103411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Interrupted random walk after 320764 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3457 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187020 steps, run timeout after 99007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 187020 steps, saw 172512 distinct states, run finished after 99008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:39:39] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:39:39] [INFO ] Invariant cache hit.
[2023-03-17 09:39:39] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:40:00] [INFO ] After 20854ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:40:01] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:40:08] [INFO ] After 7529ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:40:19] [INFO ] Deduced a trap composed of 40 places in 9870 ms of which 2 ms to minimize.
[2023-03-17 09:40:30] [INFO ] Deduced a trap composed of 64 places in 9283 ms of which 2 ms to minimize.
[2023-03-17 09:40:40] [INFO ] Deduced a trap composed of 64 places in 8745 ms of which 1 ms to minimize.
[2023-03-17 09:40:49] [INFO ] Deduced a trap composed of 64 places in 8341 ms of which 1 ms to minimize.
[2023-03-17 09:40:58] [INFO ] Deduced a trap composed of 96 places in 7961 ms of which 1 ms to minimize.
[2023-03-17 09:41:07] [INFO ] Deduced a trap composed of 40 places in 7630 ms of which 1 ms to minimize.
[2023-03-17 09:41:17] [INFO ] Deduced a trap composed of 64 places in 8879 ms of which 0 ms to minimize.
[2023-03-17 09:41:26] [INFO ] Deduced a trap composed of 96 places in 7540 ms of which 1 ms to minimize.
[2023-03-17 09:41:34] [INFO ] Deduced a trap composed of 96 places in 6921 ms of which 0 ms to minimize.
[2023-03-17 09:41:42] [INFO ] Deduced a trap composed of 64 places in 6485 ms of which 1 ms to minimize.
[2023-03-17 09:41:49] [INFO ] Deduced a trap composed of 128 places in 6367 ms of which 1 ms to minimize.
[2023-03-17 09:41:56] [INFO ] Deduced a trap composed of 128 places in 5530 ms of which 0 ms to minimize.
[2023-03-17 09:42:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 112133 ms
[2023-03-17 09:42:01] [INFO ] After 120452ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:42:01] [INFO ] After 142515ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:42:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-17 09:42:22] [INFO ] After 20995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:42:29] [INFO ] After 6602ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:42:40] [INFO ] Deduced a trap composed of 40 places in 9779 ms of which 2 ms to minimize.
[2023-03-17 09:42:50] [INFO ] Deduced a trap composed of 64 places in 9387 ms of which 2 ms to minimize.
[2023-03-17 09:43:01] [INFO ] Deduced a trap composed of 64 places in 9158 ms of which 1 ms to minimize.
[2023-03-17 09:43:10] [INFO ] Deduced a trap composed of 64 places in 8388 ms of which 1 ms to minimize.
[2023-03-17 09:43:21] [INFO ] Deduced a trap composed of 96 places in 9562 ms of which 1 ms to minimize.
[2023-03-17 09:43:30] [INFO ] Deduced a trap composed of 40 places in 7830 ms of which 1 ms to minimize.
[2023-03-17 09:43:39] [INFO ] Deduced a trap composed of 64 places in 7648 ms of which 1 ms to minimize.
[2023-03-17 09:43:47] [INFO ] Deduced a trap composed of 96 places in 7372 ms of which 0 ms to minimize.
[2023-03-17 09:43:55] [INFO ] Deduced a trap composed of 96 places in 6793 ms of which 1 ms to minimize.
[2023-03-17 09:44:04] [INFO ] Deduced a trap composed of 128 places in 8239 ms of which 1 ms to minimize.
[2023-03-17 09:44:10] [INFO ] Deduced a trap composed of 64 places in 4613 ms of which 0 ms to minimize.
[2023-03-17 09:44:15] [INFO ] Deduced a trap composed of 66 places in 4235 ms of which 1 ms to minimize.
[2023-03-17 09:44:20] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 110576 ms
[2023-03-17 09:44:20] [INFO ] After 117914ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1132 ms.
[2023-03-17 09:44:22] [INFO ] After 140223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1099 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1100 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1128 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 09:44:24] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:44:24] [INFO ] Invariant cache hit.
[2023-03-17 09:44:32] [INFO ] Implicit Places using invariants in 7997 ms returned []
Implicit Place search using SMT only with invariants took 7998 ms to find 0 implicit places.
[2023-03-17 09:44:32] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:44:32] [INFO ] Invariant cache hit.
[2023-03-17 09:45:02] [INFO ] Performed 97097/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:45:19] [INFO ] Dead Transitions using invariants and state equation in 47598 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56739 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 60402 steps, including 1 resets, run visited all 2 properties in 5807 ms. (steps per millisecond=10 )
Ensure Unique test removed 65883 transitions
Reduce isomorphic transitions removed 65883 transitions.
Iterating post reduction 0 with 65883 rules applied. Total rules applied 65883 place count 1428 transition count 84689
Applied a total of 65883 rules in 2802 ms. Remains 1428 /1428 variables (removed 0) and now considering 84689/150572 (removed 65883) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 09:45:29] [INFO ] Computed 18 place invariants in 283 ms
[2023-03-17 09:45:29] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-17 09:45:50] [INFO ] After 21170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:45:57] [INFO ] Deduced a trap composed of 64 places in 5591 ms of which 1 ms to minimize.
[2023-03-17 09:46:03] [INFO ] Deduced a trap composed of 96 places in 4992 ms of which 1 ms to minimize.
[2023-03-17 09:46:08] [INFO ] Deduced a trap composed of 64 places in 4198 ms of which 1 ms to minimize.
[2023-03-17 09:46:13] [INFO ] Deduced a trap composed of 96 places in 3802 ms of which 1 ms to minimize.
[2023-03-17 09:46:17] [INFO ] Deduced a trap composed of 64 places in 3200 ms of which 1 ms to minimize.
[2023-03-17 09:46:20] [INFO ] Deduced a trap composed of 96 places in 2087 ms of which 0 ms to minimize.
[2023-03-17 09:46:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32712 ms
[2023-03-17 09:46:24] [INFO ] After 54645ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:46:24] [INFO ] After 54838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:46:24] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:46:45] [INFO ] After 21236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:46:52] [INFO ] Deduced a trap composed of 64 places in 5623 ms of which 1 ms to minimize.
[2023-03-17 09:46:58] [INFO ] Deduced a trap composed of 96 places in 5002 ms of which 1 ms to minimize.
[2023-03-17 09:47:03] [INFO ] Deduced a trap composed of 64 places in 4353 ms of which 1 ms to minimize.
[2023-03-17 09:47:08] [INFO ] Deduced a trap composed of 96 places in 3794 ms of which 1 ms to minimize.
[2023-03-17 09:47:12] [INFO ] Deduced a trap composed of 64 places in 3221 ms of which 1 ms to minimize.
[2023-03-17 09:47:16] [INFO ] Deduced a trap composed of 96 places in 2983 ms of which 4 ms to minimize.
[2023-03-17 09:47:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 33437 ms
[2023-03-17 09:47:19] [INFO ] After 55358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1064 ms.
[2023-03-17 09:47:20] [INFO ] After 56611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 572 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 575 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:47:25] [INFO ] Flatten gal took : 3250 ms
[2023-03-17 09:47:28] [INFO ] Flatten gal took : 3343 ms
[2023-03-17 09:47:34] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 577 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 579 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:47:38] [INFO ] Flatten gal took : 2951 ms
[2023-03-17 09:47:42] [INFO ] Flatten gal took : 3596 ms
[2023-03-17 09:47:49] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 599 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 603 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:47:53] [INFO ] Flatten gal took : 2912 ms
[2023-03-17 09:47:57] [INFO ] Flatten gal took : 3428 ms
[2023-03-17 09:48:04] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 624 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 627 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:48:08] [INFO ] Flatten gal took : 2989 ms
[2023-03-17 09:48:11] [INFO ] Flatten gal took : 3130 ms
[2023-03-17 09:48:18] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 566 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:48:22] [INFO ] Flatten gal took : 2879 ms
[2023-03-17 09:48:25] [INFO ] Flatten gal took : 3338 ms
[2023-03-17 09:48:31] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 568 ms. Remains 1429 /1429 variables (removed 0) and now considering 151085/151085 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 571 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-17 09:48:35] [INFO ] Flatten gal took : 2884 ms
[2023-03-17 09:48:39] [INFO ] Flatten gal took : 3353 ms
[2023-03-17 09:48:45] [INFO ] Input system was already deterministic with 151085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 1129 ms. Remains 1428 /1429 variables (removed 1) and now considering 151084/151085 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1133 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-17 09:48:50] [INFO ] Flatten gal took : 3194 ms
[2023-03-17 09:48:53] [INFO ] Flatten gal took : 3327 ms
[2023-03-17 09:48:59] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 975 ms. (steps per millisecond=10 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 3746 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3746 steps, saw 2989 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:49:04] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-17 09:49:04] [INFO ] Computed 18 place invariants in 274 ms
[2023-03-17 09:49:04] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-17 09:49:25] [INFO ] After 21178ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:49:26] [INFO ] State equation strengthened by 773 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:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:669)
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-17 09:49:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-17 09:49:29] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 151084/151084 transitions.
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 512 rules applied. Total rules applied 512 place count 1428 transition count 150572
Applied a total of 512 rules in 1503 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/151084 (removed 512) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1507 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Interrupted random walk after 321504 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3973 ms. (steps per millisecond=251 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187409 steps, run timeout after 99002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 187409 steps, saw 172865 distinct states, run finished after 99002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 09:51:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-17 09:51:44] [INFO ] Computed 18 place invariants in 289 ms
[2023-03-17 09:51:45] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-17 09:52:06] [INFO ] After 21024ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-17 09:52:06] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-17 09:52:14] [INFO ] After 7308ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-17 09:52:25] [INFO ] Deduced a trap composed of 120 places in 10207 ms of which 1 ms to minimize.
[2023-03-17 09:52:36] [INFO ] Deduced a trap composed of 64 places in 10167 ms of which 2 ms to minimize.
[2023-03-17 09:52:47] [INFO ] Deduced a trap composed of 40 places in 9554 ms of which 1 ms to minimize.
[2023-03-17 09:52:58] [INFO ] Deduced a trap composed of 64 places in 9784 ms of which 2 ms to minimize.
[2023-03-17 09:53:08] [INFO ] Deduced a trap composed of 64 places in 8617 ms of which 2 ms to minimize.
[2023-03-17 09:53:18] [INFO ] Deduced a trap composed of 64 places in 8689 ms of which 1 ms to minimize.
[2023-03-17 09:53:27] [INFO ] Deduced a trap composed of 40 places in 8385 ms of which 1 ms to minimize.
[2023-03-17 09:53:36] [INFO ] Deduced a trap composed of 96 places in 8166 ms of which 1 ms to minimize.
[2023-03-17 09:53:45] [INFO ] Deduced a trap composed of 128 places in 7717 ms of which 1 ms to minimize.
[2023-03-17 09:53:54] [INFO ] Deduced a trap composed of 64 places in 7311 ms of which 1 ms to minimize.
[2023-03-17 09:54:01] [INFO ] Deduced a trap composed of 96 places in 6479 ms of which 0 ms to minimize.
[2023-03-17 09:54:09] [INFO ] Deduced a trap composed of 96 places in 6081 ms of which 1 ms to minimize.
[2023-03-17 09:54:15] [INFO ] Deduced a trap composed of 64 places in 5124 ms of which 0 ms to minimize.
[2023-03-17 09:54:21] [INFO ] Deduced a trap composed of 128 places in 4896 ms of which 1 ms to minimize.
[2023-03-17 09:54:26] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 131954 ms
[2023-03-17 09:54:26] [INFO ] After 140052ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:54:26] [INFO ] After 161915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-17 09:54:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-17 09:54:48] [INFO ] After 21025ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-17 09:54:55] [INFO ] After 7156ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-17 09:55:06] [INFO ] Deduced a trap composed of 120 places in 10320 ms of which 1 ms to minimize.
[2023-03-17 09:55:17] [INFO ] Deduced a trap composed of 64 places in 9596 ms of which 1 ms to minimize.
[2023-03-17 09:55:27] [INFO ] Deduced a trap composed of 40 places in 9467 ms of which 2 ms to minimize.
[2023-03-17 09:55:38] [INFO ] Deduced a trap composed of 64 places in 9666 ms of which 2 ms to minimize.
[2023-03-17 09:55:48] [INFO ] Deduced a trap composed of 64 places in 8672 ms of which 2 ms to minimize.
[2023-03-17 09:55:58] [INFO ] Deduced a trap composed of 64 places in 8852 ms of which 1 ms to minimize.
[2023-03-17 09:56:07] [INFO ] Deduced a trap composed of 40 places in 8359 ms of which 1 ms to minimize.
[2023-03-17 09:56:17] [INFO ] Deduced a trap composed of 96 places in 8350 ms of which 1 ms to minimize.
[2023-03-17 09:56:26] [INFO ] Deduced a trap composed of 128 places in 7881 ms of which 1 ms to minimize.
[2023-03-17 09:56:34] [INFO ] Deduced a trap composed of 64 places in 7267 ms of which 1 ms to minimize.
[2023-03-17 09:56:42] [INFO ] Deduced a trap composed of 96 places in 6436 ms of which 0 ms to minimize.
[2023-03-17 09:56:49] [INFO ] Deduced a trap composed of 96 places in 6203 ms of which 0 ms to minimize.
[2023-03-17 09:56:55] [INFO ] Deduced a trap composed of 64 places in 5175 ms of which 0 ms to minimize.
[2023-03-17 09:57:01] [INFO ] Deduced a trap composed of 128 places in 4868 ms of which 0 ms to minimize.
[2023-03-17 09:57:06] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 131088 ms
[2023-03-17 09:57:07] [INFO ] After 138988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1163 ms.
[2023-03-17 09:57:08] [INFO ] After 161355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1089 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1091 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1092 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-17 09:57:10] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:57:10] [INFO ] Invariant cache hit.
[2023-03-17 09:57:18] [INFO ] Implicit Places using invariants in 8476 ms returned []
Implicit Place search using SMT only with invariants took 8477 ms to find 0 implicit places.
[2023-03-17 09:57:18] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 09:57:18] [INFO ] Invariant cache hit.
[2023-03-17 09:57:49] [INFO ] Performed 96893/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-17 09:58:06] [INFO ] Dead Transitions using invariants and state equation in 47212 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56795 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 28399 steps, including 0 resets, run visited all 2 properties in 2707 ms. (steps per millisecond=10 )
Interrupted random walk after 315899 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4127 ms. (steps per millisecond=242 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 191153 steps, run timeout after 102007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 191153 steps, saw 176285 distinct states, run finished after 102007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-17 10:00:25] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-17 10:00:25] [INFO ] Invariant cache hit.
[2023-03-17 10:00:25] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12626396 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16027724 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 CTLFireability -timeout 360 -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="RERS17pb114-PT-3"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is RERS17pb114-PT-3, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889202800090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-3.tgz
mv RERS17pb114-PT-3 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;