About the Execution of LoLa+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 |
9854.460 | 3600000.00 | 4013808.00 | 9306.40 | ????T??????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r327-tall-167889199200090.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 lolaxred
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 r327-tall-167889199200090
=====================================================================
--------------------
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 1678958749578
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=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RERS17pb114-PT-3
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-16 09:25:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 09:25:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 09:25:53] [INFO ] Load time of PNML (sax parser for PT used): 1951 ms
[2023-03-16 09:25:53] [INFO ] Transformed 1446 places.
[2023-03-16 09:25:53] [INFO ] Transformed 151085 transitions.
[2023-03-16 09:25:53] [INFO ] Parsed PT model containing 1446 places and 151085 transitions and 604252 arcs in 2481 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 38 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 1075 ms. Remains 1429 /1446 variables (removed 17) and now considering 151085/151085 (removed 0) transitions.
[2023-03-16 09:25:56] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1429 cols
[2023-03-16 09:25:56] [INFO ] Computed 18 place invariants in 425 ms
[2023-03-16 09:26:03] [INFO ] Implicit Places using invariants in 7866 ms returned []
Implicit Place search using SMT only with invariants took 7900 ms to find 0 implicit places.
[2023-03-16 09:26:03] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-16 09:26:03] [INFO ] Invariant cache hit.
[2023-03-16 09:26:34] [INFO ] Performed 92290/151085 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 09:26:52] [INFO ] Dead Transitions using invariants and state equation in 49029 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 58027 ms. Remains : 1429/1446 places, 151085/151085 transitions.
Support contains 183 out of 1429 places after structural reductions.
[2023-03-16 09:26:57] [INFO ] Flatten gal took : 3567 ms
[2023-03-16 09:27:00] [INFO ] Flatten gal took : 3296 ms
[2023-03-16 09:27:07] [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 1230 ms. (steps per millisecond=8 ) properties (out of 68) seen :5
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 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 21 ms. (steps per millisecond=47 ) 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 20 ms. (steps per millisecond=50 ) properties (out of 63) 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 63) 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 63) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=6 ) properties (out of 63) 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 63) 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 63) 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 63) 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 63) 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 63) 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 63) 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 63) 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 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 20 ms. (steps per millisecond=50 ) properties (out of 63) 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 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 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 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 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 23 ms. (steps per millisecond=43 ) properties (out of 63) 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 63) 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 63) 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 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 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
Incomplete Best-First random walk after 1001 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 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 21 ms. (steps per millisecond=47 ) properties (out of 63) 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 63) 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 63) 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 63) 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 63) 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 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 20 ms. (steps per millisecond=50 ) 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 22 ms. (steps per millisecond=45 ) properties (out of 63) 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 63) 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 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 21 ms. (steps per millisecond=47 ) 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 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 21 ms. (steps per millisecond=47 ) properties (out of 63) seen :0
Interrupted probabilistic random walk after 9686 steps, run timeout after 6007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 9686 steps, saw 7999 distinct states, run finished after 6010 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 63 properties.
[2023-03-16 09:27:17] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
[2023-03-16 09:27:17] [INFO ] Invariant cache hit.
[2023-03-16 09:27:18] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-16 09:27:42] [INFO ] After 22451ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39 real:24
[2023-03-16 09:27:44] [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-16 09:27:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:27:44] [INFO ] After 27068ms 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 1 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 1659 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 1665 ms. Remains : 1429/1429 places, 150573/151085 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1785 ms. (steps per millisecond=5 ) properties (out of 63) seen :3
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 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 26 ms. (steps per millisecond=38 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 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 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 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 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 29 ms. (steps per millisecond=34 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) 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 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 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 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 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 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 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 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 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 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 1000 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 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 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 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 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 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
Interrupted probabilistic random walk after 12716 steps, run timeout after 9001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 12716 steps, saw 11421 distinct states, run finished after 9004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 60 properties.
[2023-03-16 09:27:58] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2023-03-16 09:27:58] [INFO ] Computed 18 place invariants in 291 ms
[2023-03-16 09:28:00] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 09:28:23] [INFO ] After 22576ms SMT Verify possible using state equation in real domain returned unsat :0 sat :40 real:20
[2023-03-16 09:28:24] [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-16 09:28:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:28:24] [INFO ] After 25871ms 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 1 ms.
Support contains 152 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 1084 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 1085 ms. Remains : 1429/1429 places, 150573/150573 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1045 ms. (steps per millisecond=9 ) properties (out of 60) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) 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 59) seen :0
Interrupted probabilistic random walk after 8405 steps, run timeout after 6007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 8405 steps, saw 7591 distinct states, run finished after 6007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 59 properties.
[2023-03-16 09:28:33] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
[2023-03-16 09:28:33] [INFO ] Invariant cache hit.
[2023-03-16 09:28:35] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 09:28:59] [INFO ] After 22634ms SMT Verify possible using state equation in real domain returned unsat :0 sat :39 real:20
[2023-03-16 09:29:00] [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-16 09:29:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:29:00] [INFO ] After 26037ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 59 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 150 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 1099 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 1099 ms. Remains : 1429/1429 places, 150573/150573 transitions.
[2023-03-16 09:29:04] [INFO ] Flatten gal took : 2888 ms
[2023-03-16 09:29:07] [INFO ] Flatten gal took : 3290 ms
[2023-03-16 09:29:14] [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 635 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 639 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 09:29:18] [INFO ] Flatten gal took : 2883 ms
[2023-03-16 09:29:22] [INFO ] Flatten gal took : 3266 ms
[2023-03-16 09:29:30] [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 726 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 730 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 09:29:34] [INFO ] Flatten gal took : 3216 ms
[2023-03-16 09:29:38] [INFO ] Flatten gal took : 3618 ms
[2023-03-16 09:29:47] [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 623 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 626 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 09:29:51] [INFO ] Flatten gal took : 3157 ms
[2023-03-16 09:29:55] [INFO ] Flatten gal took : 3801 ms
[2023-03-16 09:30:03] [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 1465 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 1468 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-16 09:30:08] [INFO ] Flatten gal took : 3370 ms
[2023-03-16 09:30:12] [INFO ] Flatten gal took : 3883 ms
[2023-03-16 09:30:21] [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 1347 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 1351 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-16 09:30:26] [INFO ] Flatten gal took : 3434 ms
[2023-03-16 09:30:30] [INFO ] Flatten gal took : 3813 ms
[2023-03-16 09:30:38] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1106 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4297 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4297 steps, saw 3419 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 09:30:42] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-16 09:30:43] [INFO ] Computed 18 place invariants in 399 ms
[2023-03-16 09:30:43] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-16 09:31:04] [INFO ] After 21098ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:31:05] [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-16 09:31:08] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:31:08] [INFO ] After 25037ms 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 1417 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 1420 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Interrupted random walk after 272441 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Interrupted Best-First random walk after 876661 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen 0
Interrupted probabilistic random walk after 195463 steps, run timeout after 105003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 195463 steps, saw 180186 distinct states, run finished after 105004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 09:33:30] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-16 09:33:30] [INFO ] Computed 18 place invariants in 333 ms
[2023-03-16 09:33:30] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 09:33:51] [INFO ] After 20512ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:33:51] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 09:33:59] [INFO ] After 8038ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 09:34:13] [INFO ] Deduced a trap composed of 40 places in 12005 ms of which 11 ms to minimize.
[2023-03-16 09:34:26] [INFO ] Deduced a trap composed of 40 places in 12341 ms of which 2 ms to minimize.
[2023-03-16 09:34:39] [INFO ] Deduced a trap composed of 64 places in 11895 ms of which 3 ms to minimize.
[2023-03-16 09:34:50] [INFO ] Deduced a trap composed of 64 places in 9932 ms of which 5 ms to minimize.
[2023-03-16 09:35:01] [INFO ] Deduced a trap composed of 64 places in 9790 ms of which 2 ms to minimize.
[2023-03-16 09:35:12] [INFO ] Deduced a trap composed of 64 places in 9894 ms of which 2 ms to minimize.
[2023-03-16 09:35:24] [INFO ] Deduced a trap composed of 96 places in 10172 ms of which 2 ms to minimize.
[2023-03-16 09:35:34] [INFO ] Deduced a trap composed of 128 places in 8906 ms of which 1 ms to minimize.
[2023-03-16 09:35:43] [INFO ] Deduced a trap composed of 96 places in 7798 ms of which 1 ms to minimize.
[2023-03-16 09:35:51] [INFO ] Deduced a trap composed of 64 places in 7533 ms of which 1 ms to minimize.
[2023-03-16 09:36:00] [INFO ] Deduced a trap composed of 96 places in 7381 ms of which 1 ms to minimize.
[2023-03-16 09:36:07] [INFO ] Deduced a trap composed of 64 places in 6130 ms of which 0 ms to minimize.
[2023-03-16 09:36:14] [INFO ] Deduced a trap composed of 96 places in 5367 ms of which 0 ms to minimize.
[2023-03-16 09:36:20] [INFO ] Deduced a trap composed of 128 places in 4647 ms of which 0 ms to minimize.
[2023-03-16 09:36:24] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 144376 ms
[2023-03-16 09:36:25] [INFO ] After 153218ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:36:25] [INFO ] After 174724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:36:25] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 09:36:45] [INFO ] After 20640ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 09:36:53] [INFO ] After 7231ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 09:37:05] [INFO ] Deduced a trap composed of 40 places in 11155 ms of which 2 ms to minimize.
[2023-03-16 09:37:17] [INFO ] Deduced a trap composed of 40 places in 11147 ms of which 2 ms to minimize.
[2023-03-16 09:37:29] [INFO ] Deduced a trap composed of 64 places in 10249 ms of which 2 ms to minimize.
[2023-03-16 09:37:40] [INFO ] Deduced a trap composed of 64 places in 10386 ms of which 2 ms to minimize.
[2023-03-16 09:37:51] [INFO ] Deduced a trap composed of 64 places in 10040 ms of which 2 ms to minimize.
[2023-03-16 09:38:02] [INFO ] Deduced a trap composed of 64 places in 9580 ms of which 1 ms to minimize.
[2023-03-16 09:38:12] [INFO ] Deduced a trap composed of 96 places in 9165 ms of which 1 ms to minimize.
[2023-03-16 09:38:22] [INFO ] Deduced a trap composed of 128 places in 8354 ms of which 1 ms to minimize.
[2023-03-16 09:38:30] [INFO ] Deduced a trap composed of 96 places in 7692 ms of which 1 ms to minimize.
[2023-03-16 09:38:39] [INFO ] Deduced a trap composed of 64 places in 7627 ms of which 1 ms to minimize.
[2023-03-16 09:38:48] [INFO ] Deduced a trap composed of 96 places in 7464 ms of which 1 ms to minimize.
[2023-03-16 09:38:55] [INFO ] Deduced a trap composed of 64 places in 6069 ms of which 1 ms to minimize.
[2023-03-16 09:39:01] [INFO ] Deduced a trap composed of 96 places in 5272 ms of which 1 ms to minimize.
[2023-03-16 09:39:07] [INFO ] Deduced a trap composed of 128 places in 4636 ms of which 1 ms to minimize.
[2023-03-16 09:39:11] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 138525 ms
[2023-03-16 09:39:12] [INFO ] After 146508ms 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-16 09:39:13] [INFO ] After 168521ms 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 1089 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-16 09:39:15] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:39:15] [INFO ] Invariant cache hit.
[2023-03-16 09:39:24] [INFO ] Implicit Places using invariants in 8387 ms returned []
Implicit Place search using SMT only with invariants took 8388 ms to find 0 implicit places.
[2023-03-16 09:39:24] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:39:24] [INFO ] Invariant cache hit.
[2023-03-16 09:39:54] [INFO ] Performed 98141/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 09:40:10] [INFO ] Dead Transitions using invariants and state equation in 46455 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55952 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 17469 steps, including 0 resets, run visited all 2 properties in 1766 ms. (steps per millisecond=9 )
Interrupted random walk after 297038 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Finished Best-First random walk after 12055 steps, including 0 resets, run visited all 1 properties in 68 ms. (steps per millisecond=177 )
FORMULA RERS17pb114-PT-3-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 1429/1429 places, 151085/151085 transitions.
Applied a total of 0 rules in 569 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 572 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 09:40:46] [INFO ] Flatten gal took : 2781 ms
[2023-03-16 09:40:49] [INFO ] Flatten gal took : 3250 ms
[2023-03-16 09:40:56] [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 1066 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 1069 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-16 09:41:00] [INFO ] Flatten gal took : 3106 ms
[2023-03-16 09:41:04] [INFO ] Flatten gal took : 4030 ms
[2023-03-16 09:41:13] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1153 ms. (steps per millisecond=8 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4795 steps, run timeout after 3002 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4795 steps, saw 3859 distinct states, run finished after 3002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 09:41:18] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-16 09:41:18] [INFO ] Computed 18 place invariants in 289 ms
[2023-03-16 09:41:18] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 09:41:40] [INFO ] After 21683ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:41:41] [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-16 09:41:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 09:41:43] [INFO ] After 25022ms 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 313625 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 3609 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 191649 steps, run timeout after 99001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 191649 steps, saw 176739 distinct states, run finished after 99002 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 09:43:58] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-16 09:43:58] [INFO ] Computed 18 place invariants in 277 ms
[2023-03-16 09:43:58] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 09:44:20] [INFO ] After 21599ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:44:21] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 09:44:30] [INFO ] After 8613ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 09:44:41] [INFO ] Deduced a trap composed of 40 places in 10018 ms of which 2 ms to minimize.
[2023-03-16 09:44:52] [INFO ] Deduced a trap composed of 96 places in 9937 ms of which 1 ms to minimize.
[2023-03-16 09:45:03] [INFO ] Deduced a trap composed of 64 places in 9540 ms of which 1 ms to minimize.
[2023-03-16 09:45:13] [INFO ] Deduced a trap composed of 64 places in 9120 ms of which 2 ms to minimize.
[2023-03-16 09:45:23] [INFO ] Deduced a trap composed of 40 places in 8628 ms of which 1 ms to minimize.
[2023-03-16 09:45:34] [INFO ] Deduced a trap composed of 64 places in 10135 ms of which 5 ms to minimize.
[2023-03-16 09:45:43] [INFO ] Deduced a trap composed of 96 places in 8361 ms of which 1 ms to minimize.
[2023-03-16 09:45:52] [INFO ] Deduced a trap composed of 64 places in 7606 ms of which 1 ms to minimize.
[2023-03-16 09:46:01] [INFO ] Deduced a trap composed of 128 places in 7624 ms of which 1 ms to minimize.
[2023-03-16 09:46:09] [INFO ] Deduced a trap composed of 64 places in 7168 ms of which 1 ms to minimize.
[2023-03-16 09:46:17] [INFO ] Deduced a trap composed of 96 places in 6890 ms of which 0 ms to minimize.
[2023-03-16 09:46:25] [INFO ] Deduced a trap composed of 96 places in 6139 ms of which 1 ms to minimize.
[2023-03-16 09:46:30] [INFO ] Deduced a trap composed of 64 places in 3962 ms of which 1 ms to minimize.
[2023-03-16 09:46:35] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 124985 ms
[2023-03-16 09:46:35] [INFO ] After 134453ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:46:35] [INFO ] After 157272ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:46:36] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-16 09:46:58] [INFO ] After 22219ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 09:47:05] [INFO ] After 7130ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 09:47:16] [INFO ] Deduced a trap composed of 40 places in 9986 ms of which 2 ms to minimize.
[2023-03-16 09:47:27] [INFO ] Deduced a trap composed of 96 places in 9393 ms of which 1 ms to minimize.
[2023-03-16 09:47:37] [INFO ] Deduced a trap composed of 64 places in 9590 ms of which 1 ms to minimize.
[2023-03-16 09:47:49] [INFO ] Deduced a trap composed of 64 places in 10369 ms of which 1 ms to minimize.
[2023-03-16 09:48:00] [INFO ] Deduced a trap composed of 40 places in 9847 ms of which 1 ms to minimize.
[2023-03-16 09:48:10] [INFO ] Deduced a trap composed of 64 places in 9556 ms of which 1 ms to minimize.
[2023-03-16 09:48:20] [INFO ] Deduced a trap composed of 96 places in 9083 ms of which 1 ms to minimize.
[2023-03-16 09:48:31] [INFO ] Deduced a trap composed of 64 places in 9132 ms of which 2 ms to minimize.
[2023-03-16 09:48:39] [INFO ] Deduced a trap composed of 128 places in 7589 ms of which 3 ms to minimize.
[2023-03-16 09:48:48] [INFO ] Deduced a trap composed of 64 places in 7208 ms of which 1 ms to minimize.
[2023-03-16 09:48:55] [INFO ] Deduced a trap composed of 96 places in 6653 ms of which 1 ms to minimize.
[2023-03-16 09:49:02] [INFO ] Deduced a trap composed of 96 places in 5884 ms of which 1 ms to minimize.
[2023-03-16 09:49:08] [INFO ] Deduced a trap composed of 66 places in 4442 ms of which 0 ms to minimize.
[2023-03-16 09:49:13] [INFO ] Deduced a trap composed of 64 places in 3785 ms of which 2 ms to minimize.
[2023-03-16 09:49:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 132147 ms
[2023-03-16 09:49:18] [INFO ] After 140027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1215 ms.
[2023-03-16 09:49:19] [INFO ] After 163656ms 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 1100 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 1086 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-16 09:49:21] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:49:21] [INFO ] Invariant cache hit.
[2023-03-16 09:49:30] [INFO ] Implicit Places using invariants in 8421 ms returned []
Implicit Place search using SMT only with invariants took 8422 ms to find 0 implicit places.
[2023-03-16 09:49:30] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:49:30] [INFO ] Invariant cache hit.
[2023-03-16 09:50:00] [INFO ] Performed 96744/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 09:50:17] [INFO ] Dead Transitions using invariants and state equation in 46864 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56384 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 14228 steps, including 0 resets, run visited all 2 properties in 1560 ms. (steps per millisecond=9 )
Interrupted random walk after 242401 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Interrupted Best-First random walk after 907278 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen 0
Interrupted probabilistic random walk after 177098 steps, run timeout after 105007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 177098 steps, saw 163462 distinct states, run finished after 105009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 09:52:39] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:52:39] [INFO ] Invariant cache hit.
[2023-03-16 09:52:39] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-16 09:53:01] [INFO ] After 22357ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:53:02] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 09:53:09] [INFO ] After 7359ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 09:53:22] [INFO ] Deduced a trap composed of 40 places in 11687 ms of which 2 ms to minimize.
[2023-03-16 09:53:34] [INFO ] Deduced a trap composed of 64 places in 10619 ms of which 2 ms to minimize.
[2023-03-16 09:53:45] [INFO ] Deduced a trap composed of 64 places in 9964 ms of which 1 ms to minimize.
[2023-03-16 09:53:56] [INFO ] Deduced a trap composed of 64 places in 9004 ms of which 1 ms to minimize.
[2023-03-16 09:54:05] [INFO ] Deduced a trap composed of 96 places in 7931 ms of which 1 ms to minimize.
[2023-03-16 09:54:16] [INFO ] Deduced a trap composed of 40 places in 9688 ms of which 1 ms to minimize.
[2023-03-16 09:54:25] [INFO ] Deduced a trap composed of 64 places in 8102 ms of which 1 ms to minimize.
[2023-03-16 09:54:36] [INFO ] Deduced a trap composed of 96 places in 9161 ms of which 0 ms to minimize.
[2023-03-16 09:54:44] [INFO ] Deduced a trap composed of 96 places in 6848 ms of which 8 ms to minimize.
[2023-03-16 09:54:53] [INFO ] Deduced a trap composed of 64 places in 8103 ms of which 1 ms to minimize.
[2023-03-16 09:55:02] [INFO ] Deduced a trap composed of 128 places in 7951 ms of which 2 ms to minimize.
[2023-03-16 09:55:09] [INFO ] Deduced a trap composed of 128 places in 5584 ms of which 0 ms to minimize.
[2023-03-16 09:55:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 124535 ms
[2023-03-16 09:55:14] [INFO ] After 132706ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:55:14] [INFO ] After 155914ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:55:15] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-16 09:55:35] [INFO ] After 20671ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 09:55:42] [INFO ] After 6960ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 09:55:55] [INFO ] Deduced a trap composed of 40 places in 11530 ms of which 2 ms to minimize.
[2023-03-16 09:56:06] [INFO ] Deduced a trap composed of 64 places in 9497 ms of which 1 ms to minimize.
[2023-03-16 09:56:15] [INFO ] Deduced a trap composed of 64 places in 8787 ms of which 1 ms to minimize.
[2023-03-16 09:56:25] [INFO ] Deduced a trap composed of 64 places in 8305 ms of which 2 ms to minimize.
[2023-03-16 09:56:34] [INFO ] Deduced a trap composed of 96 places in 8101 ms of which 1 ms to minimize.
[2023-03-16 09:56:43] [INFO ] Deduced a trap composed of 40 places in 7714 ms of which 1 ms to minimize.
[2023-03-16 09:56:52] [INFO ] Deduced a trap composed of 64 places in 7795 ms of which 1 ms to minimize.
[2023-03-16 09:57:00] [INFO ] Deduced a trap composed of 96 places in 7598 ms of which 1 ms to minimize.
[2023-03-16 09:57:08] [INFO ] Deduced a trap composed of 96 places in 6860 ms of which 1 ms to minimize.
[2023-03-16 09:57:18] [INFO ] Deduced a trap composed of 128 places in 8897 ms of which 1 ms to minimize.
[2023-03-16 09:57:24] [INFO ] Deduced a trap composed of 64 places in 4655 ms of which 0 ms to minimize.
[2023-03-16 09:57:30] [INFO ] Deduced a trap composed of 66 places in 4280 ms of which 1 ms to minimize.
[2023-03-16 09:57:34] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 111766 ms
[2023-03-16 09:57:35] [INFO ] After 119473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1152 ms.
[2023-03-16 09:57:36] [INFO ] After 141471ms 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 1117 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 1117 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 1118 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-16 09:57:38] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:57:38] [INFO ] Invariant cache hit.
[2023-03-16 09:57:46] [INFO ] Implicit Places using invariants in 7684 ms returned []
Implicit Place search using SMT only with invariants took 7684 ms to find 0 implicit places.
[2023-03-16 09:57:46] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 09:57:46] [INFO ] Invariant cache hit.
[2023-03-16 09:58:16] [INFO ] Performed 95725/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 09:58:33] [INFO ] Dead Transitions using invariants and state equation in 47062 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55877 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 15072 steps, including 0 resets, run visited all 2 properties in 1442 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 2860 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-16 09:58:38] [INFO ] Computed 18 place invariants in 251 ms
[2023-03-16 09:58:38] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 09:58:59] [INFO ] After 21288ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 09:59:06] [INFO ] Deduced a trap composed of 64 places in 5372 ms of which 1 ms to minimize.
[2023-03-16 09:59:12] [INFO ] Deduced a trap composed of 96 places in 5361 ms of which 1 ms to minimize.
[2023-03-16 09:59:18] [INFO ] Deduced a trap composed of 64 places in 4280 ms of which 1 ms to minimize.
[2023-03-16 09:59:23] [INFO ] Deduced a trap composed of 96 places in 3843 ms of which 0 ms to minimize.
[2023-03-16 09:59:27] [INFO ] Deduced a trap composed of 64 places in 3148 ms of which 0 ms to minimize.
[2023-03-16 09:59:30] [INFO ] Deduced a trap composed of 96 places in 2071 ms of which 0 ms to minimize.
[2023-03-16 09:59:32] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32878 ms
[2023-03-16 09:59:33] [INFO ] After 54935ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:59:33] [INFO ] After 55122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 09:59:33] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 09:59:55] [INFO ] After 21987ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:00:03] [INFO ] Deduced a trap composed of 64 places in 6340 ms of which 1 ms to minimize.
[2023-03-16 10:00:10] [INFO ] Deduced a trap composed of 96 places in 5727 ms of which 1 ms to minimize.
[2023-03-16 10:00:16] [INFO ] Deduced a trap composed of 64 places in 4841 ms of which 1 ms to minimize.
[2023-03-16 10:00:21] [INFO ] Deduced a trap composed of 96 places in 4128 ms of which 1 ms to minimize.
[2023-03-16 10:00:26] [INFO ] Deduced a trap composed of 64 places in 3478 ms of which 1 ms to minimize.
[2023-03-16 10:00:29] [INFO ] Deduced a trap composed of 96 places in 2132 ms of which 0 ms to minimize.
[2023-03-16 10:00:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 35754 ms
[2023-03-16 10:00:32] [INFO ] After 58438ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1106 ms.
[2023-03-16 10:00:33] [INFO ] After 59716ms 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 560 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 563 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:00:37] [INFO ] Flatten gal took : 2889 ms
[2023-03-16 10:00:40] [INFO ] Flatten gal took : 2946 ms
[2023-03-16 10:00: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 554 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 557 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:00:53] [INFO ] Flatten gal took : 2982 ms
[2023-03-16 10:00:56] [INFO ] Flatten gal took : 3318 ms
[2023-03-16 10:01: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 771 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 775 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:01:08] [INFO ] Flatten gal took : 2809 ms
[2023-03-16 10:01:11] [INFO ] Flatten gal took : 3320 ms
[2023-03-16 10:01: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 633 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 638 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:01:22] [INFO ] Flatten gal took : 2894 ms
[2023-03-16 10:01:25] [INFO ] Flatten gal took : 3450 ms
[2023-03-16 10:01:33] [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 585 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 588 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:01:37] [INFO ] Flatten gal took : 3193 ms
[2023-03-16 10:01:40] [INFO ] Flatten gal took : 3246 ms
[2023-03-16 10:01:46] [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 575 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 578 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:01:50] [INFO ] Flatten gal took : 2829 ms
[2023-03-16 10:01:54] [INFO ] Flatten gal took : 3397 ms
[2023-03-16 10:02:00] [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 1128 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 1131 ms. Remains : 1428/1429 places, 151084/151085 transitions.
[2023-03-16 10:02:05] [INFO ] Flatten gal took : 3148 ms
[2023-03-16 10:02:09] [INFO ] Flatten gal took : 3750 ms
[2023-03-16 10:02:15] [INFO ] Input system was already deterministic with 151084 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 841 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4205 steps, run timeout after 3001 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 4205 steps, saw 3343 distinct states, run finished after 3001 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:02:20] [INFO ] Flow matrix only has 84690 transitions (discarded 66394 similar events)
// Phase 1: matrix 84690 rows 1428 cols
[2023-03-16 10:02:20] [INFO ] Computed 18 place invariants in 314 ms
[2023-03-16 10:02:20] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-16 10:02:43] [INFO ] After 22235ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:02:44] [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-16 10:02:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 10:02:45] [INFO ] After 25026ms 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 1304 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 1307 ms. Remains : 1428/1428 places, 150572/151084 transitions.
Interrupted random walk after 303037 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 4108 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 197945 steps, run timeout after 102007 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 197945 steps, saw 182467 distinct states, run finished after 102008 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:05:03] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-16 10:05:03] [INFO ] Computed 18 place invariants in 264 ms
[2023-03-16 10:05:03] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 10:05:24] [INFO ] After 21016ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:05:25] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 10:05:32] [INFO ] After 7026ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 10:05:44] [INFO ] Deduced a trap composed of 120 places in 10120 ms of which 1 ms to minimize.
[2023-03-16 10:05:54] [INFO ] Deduced a trap composed of 64 places in 9538 ms of which 2 ms to minimize.
[2023-03-16 10:06:06] [INFO ] Deduced a trap composed of 40 places in 9896 ms of which 2 ms to minimize.
[2023-03-16 10:06:16] [INFO ] Deduced a trap composed of 64 places in 9526 ms of which 1 ms to minimize.
[2023-03-16 10:06:26] [INFO ] Deduced a trap composed of 64 places in 8847 ms of which 2 ms to minimize.
[2023-03-16 10:06:36] [INFO ] Deduced a trap composed of 64 places in 8594 ms of which 1 ms to minimize.
[2023-03-16 10:06:46] [INFO ] Deduced a trap composed of 40 places in 8665 ms of which 1 ms to minimize.
[2023-03-16 10:06:56] [INFO ] Deduced a trap composed of 96 places in 8407 ms of which 1 ms to minimize.
[2023-03-16 10:07:05] [INFO ] Deduced a trap composed of 128 places in 7778 ms of which 1 ms to minimize.
[2023-03-16 10:07:13] [INFO ] Deduced a trap composed of 64 places in 7686 ms of which 1 ms to minimize.
[2023-03-16 10:07:21] [INFO ] Deduced a trap composed of 96 places in 6468 ms of which 0 ms to minimize.
[2023-03-16 10:07:28] [INFO ] Deduced a trap composed of 96 places in 6049 ms of which 1 ms to minimize.
[2023-03-16 10:07:35] [INFO ] Deduced a trap composed of 64 places in 5115 ms of which 1 ms to minimize.
[2023-03-16 10:07:41] [INFO ] Deduced a trap composed of 128 places in 4912 ms of which 0 ms to minimize.
[2023-03-16 10:07:46] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 133104 ms
[2023-03-16 10:07:46] [INFO ] After 140938ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:07:46] [INFO ] After 163043ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:07:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 10:08:08] [INFO ] After 21381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:08:14] [INFO ] After 6446ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 10:08:25] [INFO ] Deduced a trap composed of 120 places in 9940 ms of which 2 ms to minimize.
[2023-03-16 10:08:36] [INFO ] Deduced a trap composed of 64 places in 9494 ms of which 2 ms to minimize.
[2023-03-16 10:08:47] [INFO ] Deduced a trap composed of 40 places in 9824 ms of which 1 ms to minimize.
[2023-03-16 10:08:58] [INFO ] Deduced a trap composed of 64 places in 9887 ms of which 1 ms to minimize.
[2023-03-16 10:09:07] [INFO ] Deduced a trap composed of 64 places in 8668 ms of which 1 ms to minimize.
[2023-03-16 10:09:17] [INFO ] Deduced a trap composed of 64 places in 8568 ms of which 1 ms to minimize.
[2023-03-16 10:09:27] [INFO ] Deduced a trap composed of 40 places in 8336 ms of which 1 ms to minimize.
[2023-03-16 10:09:36] [INFO ] Deduced a trap composed of 96 places in 8602 ms of which 1 ms to minimize.
[2023-03-16 10:09:45] [INFO ] Deduced a trap composed of 128 places in 8113 ms of which 1 ms to minimize.
[2023-03-16 10:09:54] [INFO ] Deduced a trap composed of 64 places in 7320 ms of which 0 ms to minimize.
[2023-03-16 10:10:01] [INFO ] Deduced a trap composed of 96 places in 6392 ms of which 1 ms to minimize.
[2023-03-16 10:10:09] [INFO ] Deduced a trap composed of 96 places in 6088 ms of which 0 ms to minimize.
[2023-03-16 10:10:15] [INFO ] Deduced a trap composed of 64 places in 5111 ms of which 0 ms to minimize.
[2023-03-16 10:10:21] [INFO ] Deduced a trap composed of 128 places in 4806 ms of which 0 ms to minimize.
[2023-03-16 10:10:25] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 130874 ms
[2023-03-16 10:10:26] [INFO ] After 138061ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1213 ms.
[2023-03-16 10:10:27] [INFO ] After 160831ms 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 1131 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 1131 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 1117 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-16 10:10:29] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:10:29] [INFO ] Invariant cache hit.
[2023-03-16 10:10:38] [INFO ] Implicit Places using invariants in 8344 ms returned []
Implicit Place search using SMT only with invariants took 8346 ms to find 0 implicit places.
[2023-03-16 10:10:38] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:10:38] [INFO ] Invariant cache hit.
[2023-03-16 10:11:08] [INFO ] Performed 97531/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 10:11:25] [INFO ] Dead Transitions using invariants and state equation in 47080 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56555 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Finished random walk after 4998 steps, including 0 resets, run visited all 2 properties in 465 ms. (steps per millisecond=10 )
Interrupted random walk after 308786 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 4252 ms. (steps per millisecond=235 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 177804 steps, run timeout after 102005 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 177804 steps, saw 164084 distinct states, run finished after 102006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:13:42] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:13:42] [INFO ] Invariant cache hit.
[2023-03-16 10:13:42] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 10:14:03] [INFO ] After 21063ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:14:04] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 10:14:11] [INFO ] After 7414ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 10:14:23] [INFO ] Deduced a trap composed of 64 places in 10669 ms of which 2 ms to minimize.
[2023-03-16 10:14:34] [INFO ] Deduced a trap composed of 64 places in 9925 ms of which 1 ms to minimize.
[2023-03-16 10:14:45] [INFO ] Deduced a trap composed of 96 places in 9458 ms of which 2 ms to minimize.
[2023-03-16 10:14:55] [INFO ] Deduced a trap composed of 64 places in 8715 ms of which 1 ms to minimize.
[2023-03-16 10:15:05] [INFO ] Deduced a trap composed of 40 places in 8792 ms of which 1 ms to minimize.
[2023-03-16 10:15:15] [INFO ] Deduced a trap composed of 96 places in 8557 ms of which 1 ms to minimize.
[2023-03-16 10:15:24] [INFO ] Deduced a trap composed of 64 places in 8029 ms of which 1 ms to minimize.
[2023-03-16 10:15:34] [INFO ] Deduced a trap composed of 64 places in 9421 ms of which 1 ms to minimize.
[2023-03-16 10:15:43] [INFO ] Deduced a trap composed of 96 places in 7333 ms of which 1 ms to minimize.
[2023-03-16 10:15:51] [INFO ] Deduced a trap composed of 40 places in 6665 ms of which 0 ms to minimize.
[2023-03-16 10:15:58] [INFO ] Deduced a trap composed of 96 places in 6548 ms of which 1 ms to minimize.
[2023-03-16 10:16:05] [INFO ] Deduced a trap composed of 128 places in 5674 ms of which 1 ms to minimize.
[2023-03-16 10:16:11] [INFO ] Deduced a trap composed of 128 places in 4875 ms of which 0 ms to minimize.
[2023-03-16 10:16:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 124751 ms
[2023-03-16 10:16:17] [INFO ] After 132946ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:16:17] [INFO ] After 154823ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:16:17] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 10:16:39] [INFO ] After 21650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:16:48] [INFO ] After 9085ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 10:16:59] [INFO ] Deduced a trap composed of 64 places in 10235 ms of which 1 ms to minimize.
[2023-03-16 10:17:10] [INFO ] Deduced a trap composed of 64 places in 9204 ms of which 2 ms to minimize.
[2023-03-16 10:17:20] [INFO ] Deduced a trap composed of 96 places in 8902 ms of which 1 ms to minimize.
[2023-03-16 10:17:29] [INFO ] Deduced a trap composed of 64 places in 8583 ms of which 1 ms to minimize.
[2023-03-16 10:17:39] [INFO ] Deduced a trap composed of 40 places in 8513 ms of which 1 ms to minimize.
[2023-03-16 10:17:48] [INFO ] Deduced a trap composed of 96 places in 8217 ms of which 2 ms to minimize.
[2023-03-16 10:17:57] [INFO ] Deduced a trap composed of 64 places in 8101 ms of which 1 ms to minimize.
[2023-03-16 10:18:06] [INFO ] Deduced a trap composed of 64 places in 8055 ms of which 1 ms to minimize.
[2023-03-16 10:18:15] [INFO ] Deduced a trap composed of 96 places in 7254 ms of which 0 ms to minimize.
[2023-03-16 10:18:23] [INFO ] Deduced a trap composed of 40 places in 6594 ms of which 0 ms to minimize.
[2023-03-16 10:18:30] [INFO ] Deduced a trap composed of 96 places in 6388 ms of which 1 ms to minimize.
[2023-03-16 10:18:37] [INFO ] Deduced a trap composed of 128 places in 5731 ms of which 0 ms to minimize.
[2023-03-16 10:18:43] [INFO ] Deduced a trap composed of 128 places in 5047 ms of which 0 ms to minimize.
[2023-03-16 10:18:48] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 119793 ms
[2023-03-16 10:18:48] [INFO ] After 129650ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1186 ms.
[2023-03-16 10:18:49] [INFO ] After 152665ms 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 1198 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 1199 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 1185 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-16 10:18:52] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:18:52] [INFO ] Invariant cache hit.
[2023-03-16 10:18:59] [INFO ] Implicit Places using invariants in 7636 ms returned []
Implicit Place search using SMT only with invariants took 7637 ms to find 0 implicit places.
[2023-03-16 10:19:00] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:19:00] [INFO ] Invariant cache hit.
[2023-03-16 10:19:30] [INFO ] Performed 95302/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 10:19:47] [INFO ] Dead Transitions using invariants and state equation in 47178 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56013 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 9244 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-16 10:19:56] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:19:56] [INFO ] Invariant cache hit.
[2023-03-16 10:19:57] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2023-03-16 10:20:17] [INFO ] After 20199ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:20:18] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-16 10:20:24] [INFO ] After 5540ms SMT Verify possible using 773 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-16 10:20:35] [INFO ] Deduced a trap composed of 40 places in 10784 ms of which 2 ms to minimize.
[2023-03-16 10:20:47] [INFO ] Deduced a trap composed of 96 places in 10310 ms of which 2 ms to minimize.
[2023-03-16 10:20:58] [INFO ] Deduced a trap composed of 64 places in 9928 ms of which 1 ms to minimize.
[2023-03-16 10:21:09] [INFO ] Deduced a trap composed of 64 places in 9807 ms of which 1 ms to minimize.
[2023-03-16 10:21:18] [INFO ] Deduced a trap composed of 64 places in 8096 ms of which 1 ms to minimize.
[2023-03-16 10:21:27] [INFO ] Deduced a trap composed of 64 places in 7987 ms of which 1 ms to minimize.
[2023-03-16 10:21:36] [INFO ] Deduced a trap composed of 40 places in 7499 ms of which 1 ms to minimize.
[2023-03-16 10:21:49] [INFO ] Deduced a trap composed of 4 places in 12110 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.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
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-16 10:21:49] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 10:21:49] [INFO ] After 112151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Finished random walk after 1476 steps, including 0 resets, run visited all 1 properties in 133 ms. (steps per millisecond=11 )
Incomplete random walk after 10000 steps, including 2 resets, run finished after 942 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 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3818 steps, run timeout after 3004 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3818 steps, saw 3382 distinct states, run finished after 3004 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:21:54] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:21:54] [INFO ] Invariant cache hit.
[2023-03-16 10:21:54] [INFO ] [Real]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-16 10:22:15] [INFO ] After 21098ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:22:16] [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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.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-16 10:22:19] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 10:22:19] [INFO ] After 25019ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 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 1095 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 1098 ms. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3921 steps, run timeout after 3003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 3921 steps, saw 3476 distinct states, run finished after 3003 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 10:22:25] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:22:25] [INFO ] Invariant cache hit.
[2023-03-16 10:22:25] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2023-03-16 10:22:46] [INFO ] After 21727ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:22:47] [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.solver.logic.AtomicReducerSR.checkAtomicPropositions(AtomicReducerSR.java:365)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:253)
at fr.lip6.move.gal.application.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-16 10:22:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-16 10:22:50] [INFO ] After 25025ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 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 1264 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 1264 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 1137 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-16 10:22:52] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:22:52] [INFO ] Invariant cache hit.
[2023-03-16 10:23:01] [INFO ] Implicit Places using invariants in 8591 ms returned []
Implicit Place search using SMT only with invariants took 8591 ms to find 0 implicit places.
[2023-03-16 10:23:01] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
[2023-03-16 10:23:01] [INFO ] Invariant cache hit.
[2023-03-16 10:23:31] [INFO ] Performed 97144/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-16 10:23:47] [INFO ] Dead Transitions using invariants and state equation in 46669 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56412 ms. Remains : 1428/1428 places, 150572/150572 transitions.
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 2803 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-16 10:23:51] [INFO ] Computed 18 place invariants in 279 ms
[2023-03-16 10:23:51] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-16 10:24:12] [INFO ] After 21050ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-16 10:24:19] [INFO ] Deduced a trap composed of 64 places in 5925 ms of which 1 ms to minimize.
[2023-03-16 10:24:25] [INFO ] Deduced a trap composed of 96 places in 5146 ms of which 1 ms to minimize.
[2023-03-16 10:24:30] [INFO ] Deduced a trap composed of 64 places in 4042 ms of which 0 ms to minimize.
[2023-03-16 10:24:35] [INFO ] Deduced a trap composed of 64 places in 3389 ms of which 0 ms to minimize.
[2023-03-16 10:24:39] [INFO ] Deduced a trap composed of 96 places in 2665 ms of which 0 ms to minimize.
[2023-03-16 10:24:42] [INFO ] Deduced a trap composed of 96 places in 2226 ms of which 1 ms to minimize.
[2023-03-16 10:24:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32509 ms
[2023-03-16 10:24:45] [INFO ] After 54330ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:24:45] [INFO ] After 54513ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 10:24:45] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2023-03-16 10:25:07] [INFO ] After 21703ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 10:25:14] [INFO ] Deduced a trap composed of 64 places in 6264 ms of which 1 ms to minimize.
[2023-03-16 10:25:20] [INFO ] Deduced a trap composed of 96 places in 4788 ms of which 1 ms to minimize.
[2023-03-16 10:25:26] [INFO ] Deduced a trap composed of 64 places in 4212 ms of which 1 ms to minimize.
[2023-03-16 10:25:30] [INFO ] Deduced a trap composed of 64 places in 3362 ms of which 1 ms to minimize.
[2023-03-16 10:25:34] [INFO ] Deduced a trap composed of 96 places in 2736 ms of which 0 ms to minimize.
[2023-03-16 10:25:37] [INFO ] Deduced a trap composed of 96 places in 2316 ms of which 0 ms to minimize.
[2023-03-16 10:25:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 32363 ms
[2023-03-16 10:25:40] [INFO ] After 54776ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1196 ms.
[2023-03-16 10:25:41] [INFO ] After 56151ms 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 548 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 551 ms. Remains : 1429/1429 places, 151085/151085 transitions.
[2023-03-16 10:25:45] [INFO ] Flatten gal took : 2739 ms
[2023-03-16 10:25:49] [INFO ] Flatten gal took : 3185 ms
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 12916940 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16025176 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="lolaxred"
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 lolaxred"
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 r327-tall-167889199200090"
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 ;