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.r265-smll-167863540300644.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 ltsminxred
Input is Peterson-PT-7, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863540300644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.9M
-rw-r--r-- 1 mcc users 323K Feb 25 22:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 22:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 139K Feb 25 22:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 629K Feb 25 22:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 141K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 411K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 318K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 197K Feb 25 23:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 794K Feb 25 23:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 608K Feb 25 23:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Feb 25 23:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 49K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 1.3M 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 Peterson-PT-7-LTLFireability-00
FORMULA_NAME Peterson-PT-7-LTLFireability-01
FORMULA_NAME Peterson-PT-7-LTLFireability-02
FORMULA_NAME Peterson-PT-7-LTLFireability-03
FORMULA_NAME Peterson-PT-7-LTLFireability-04
FORMULA_NAME Peterson-PT-7-LTLFireability-05
FORMULA_NAME Peterson-PT-7-LTLFireability-06
FORMULA_NAME Peterson-PT-7-LTLFireability-07
FORMULA_NAME Peterson-PT-7-LTLFireability-08
FORMULA_NAME Peterson-PT-7-LTLFireability-09
FORMULA_NAME Peterson-PT-7-LTLFireability-10
FORMULA_NAME Peterson-PT-7-LTLFireability-11
FORMULA_NAME Peterson-PT-7-LTLFireability-12
FORMULA_NAME Peterson-PT-7-LTLFireability-13
FORMULA_NAME Peterson-PT-7-LTLFireability-14
FORMULA_NAME Peterson-PT-7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679174105399

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-18 21:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 21:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:15:08] [INFO ] Load time of PNML (sax parser for PT used): 283 ms
[2023-03-18 21:15:08] [INFO ] Transformed 1992 places.
[2023-03-18 21:15:08] [INFO ] Transformed 3096 transitions.
[2023-03-18 21:15:08] [INFO ] Found NUPN structural information;
[2023-03-18 21:15:08] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2023-03-18 21:15:08] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 483 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 49 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Peterson-PT-7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1155 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 186 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:15:09] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:15:09] [INFO ] Computed 31 place invariants in 55 ms
[2023-03-18 21:15:11] [INFO ] Implicit Places using invariants in 1609 ms returned []
[2023-03-18 21:15:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:15:11] [INFO ] Invariant cache hit.
[2023-03-18 21:15:12] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 2710 ms to find 0 implicit places.
[2023-03-18 21:15:12] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:15:12] [INFO ] Invariant cache hit.
[2023-03-18 21:15:15] [INFO ] Dead Transitions using invariants and state equation in 2613 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5514 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1155 out of 1992 places after structural reductions.
[2023-03-18 21:15:15] [INFO ] Flatten gal took : 342 ms
[2023-03-18 21:15:16] [INFO ] Flatten gal took : 203 ms
[2023-03-18 21:15:16] [INFO ] Input system was already deterministic with 3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=15 ) properties (out of 27) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-18 21:15:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:15:17] [INFO ] Invariant cache hit.
[2023-03-18 21:15:18] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2023-03-18 21:15:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:15:21] [INFO ] After 3470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 21:15:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 29 ms returned sat
[2023-03-18 21:15:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-18 21:15:24] [INFO ] After 2301ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 21:15:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:15:26] [INFO ] After 1350ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 21:15:28] [INFO ] Deduced a trap composed of 54 places in 1787 ms of which 11 ms to minimize.
[2023-03-18 21:15:30] [INFO ] Deduced a trap composed of 25 places in 1811 ms of which 3 ms to minimize.
[2023-03-18 21:15:31] [INFO ] Deduced a trap composed of 13 places in 1610 ms of which 2 ms to minimize.
[2023-03-18 21:15:33] [INFO ] Deduced a trap composed of 20 places in 1824 ms of which 5 ms to minimize.
[2023-03-18 21:15:35] [INFO ] Deduced a trap composed of 24 places in 1770 ms of which 3 ms to minimize.
[2023-03-18 21:15:37] [INFO ] Deduced a trap composed of 93 places in 1476 ms of which 2 ms to minimize.
[2023-03-18 21:15:39] [INFO ] Deduced a trap composed of 59 places in 1619 ms of which 2 ms to minimize.
[2023-03-18 21:15:41] [INFO ] Deduced a trap composed of 13 places in 1677 ms of which 3 ms to minimize.
[2023-03-18 21:15:42] [INFO ] Deduced a trap composed of 86 places in 1609 ms of which 3 ms to minimize.
[2023-03-18 21:15:44] [INFO ] Deduced a trap composed of 48 places in 1595 ms of which 2 ms to minimize.
[2023-03-18 21:15:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 18507 ms
[2023-03-18 21:15:46] [INFO ] Deduced a trap composed of 70 places in 1605 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:15:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:15:46] [INFO ] After 25525ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
Fused 8 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 98 ms.
Support contains 12 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 884 transitions
Trivial Post-agglo rules discarded 884 transitions
Performed 884 trivial Post agglomeration. Transition count delta: 884
Iterating post reduction 0 with 884 rules applied. Total rules applied 884 place count 1992 transition count 2212
Reduce places removed 884 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 888 rules applied. Total rules applied 1772 place count 1108 transition count 2208
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 1776 place count 1104 transition count 2208
Performed 444 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 444 Pre rules applied. Total rules applied 1776 place count 1104 transition count 1764
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
Iterating global reduction 3 with 888 rules applied. Total rules applied 2664 place count 660 transition count 1764
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 24 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 2772 place count 606 transition count 1710
Applied a total of 2772 rules in 613 ms. Remains 606 /1992 variables (removed 1386) and now considering 1710/3096 (removed 1386) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 606/1992 places, 1710/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-18 21:15:47] [INFO ] Flow matrix only has 1374 transitions (discarded 336 similar events)
// Phase 1: matrix 1374 rows 606 cols
[2023-03-18 21:15:47] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-18 21:15:48] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:15:48] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:15:49] [INFO ] After 727ms SMT Verify possible using state equation in real domain returned unsat :0 sat :7
[2023-03-18 21:15:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:15:49] [INFO ] After 456ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:15:49] [INFO ] After 1717ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:15:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:15:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-18 21:15:50] [INFO ] After 702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 21:15:51] [INFO ] After 415ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 21:15:51] [INFO ] Deduced a trap composed of 45 places in 424 ms of which 4 ms to minimize.
[2023-03-18 21:15:52] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2023-03-18 21:15:52] [INFO ] Deduced a trap composed of 29 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:15:53] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 0 ms to minimize.
[2023-03-18 21:15:53] [INFO ] Deduced a trap composed of 27 places in 402 ms of which 3 ms to minimize.
[2023-03-18 21:15:53] [INFO ] Deduced a trap composed of 79 places in 419 ms of which 1 ms to minimize.
[2023-03-18 21:15:54] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 4 ms to minimize.
[2023-03-18 21:15:54] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 0 ms to minimize.
[2023-03-18 21:15:55] [INFO ] Deduced a trap composed of 23 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:15:55] [INFO ] Deduced a trap composed of 25 places in 361 ms of which 2 ms to minimize.
[2023-03-18 21:15:56] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 2 ms to minimize.
[2023-03-18 21:15:56] [INFO ] Deduced a trap composed of 11 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:15:57] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 1 ms to minimize.
[2023-03-18 21:15:57] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2023-03-18 21:15:57] [INFO ] Deduced a trap composed of 27 places in 414 ms of which 0 ms to minimize.
[2023-03-18 21:15:58] [INFO ] Deduced a trap composed of 11 places in 357 ms of which 0 ms to minimize.
[2023-03-18 21:15:58] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7323 ms
[2023-03-18 21:15:58] [INFO ] Deduced a trap composed of 138 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:15:59] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 1 ms to minimize.
[2023-03-18 21:15:59] [INFO ] Deduced a trap composed of 67 places in 396 ms of which 1 ms to minimize.
[2023-03-18 21:16:00] [INFO ] Deduced a trap composed of 50 places in 397 ms of which 1 ms to minimize.
[2023-03-18 21:16:00] [INFO ] Deduced a trap composed of 62 places in 402 ms of which 0 ms to minimize.
[2023-03-18 21:16:01] [INFO ] Deduced a trap composed of 35 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:16:01] [INFO ] Deduced a trap composed of 41 places in 391 ms of which 2 ms to minimize.
[2023-03-18 21:16:02] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 8 ms to minimize.
[2023-03-18 21:16:02] [INFO ] Deduced a trap composed of 21 places in 383 ms of which 0 ms to minimize.
[2023-03-18 21:16:03] [INFO ] Deduced a trap composed of 20 places in 379 ms of which 1 ms to minimize.
[2023-03-18 21:16:03] [INFO ] Deduced a trap composed of 45 places in 336 ms of which 0 ms to minimize.
[2023-03-18 21:16:03] [INFO ] Deduced a trap composed of 44 places in 314 ms of which 1 ms to minimize.
[2023-03-18 21:16:04] [INFO ] Deduced a trap composed of 41 places in 316 ms of which 2 ms to minimize.
[2023-03-18 21:16:04] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 1 ms to minimize.
[2023-03-18 21:16:04] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:16:05] [INFO ] Deduced a trap composed of 61 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:16:05] [INFO ] Deduced a trap composed of 61 places in 280 ms of which 1 ms to minimize.
[2023-03-18 21:16:05] [INFO ] Deduced a trap composed of 70 places in 284 ms of which 0 ms to minimize.
[2023-03-18 21:16:06] [INFO ] Deduced a trap composed of 57 places in 284 ms of which 1 ms to minimize.
[2023-03-18 21:16:06] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 1 ms to minimize.
[2023-03-18 21:16:06] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 1 ms to minimize.
[2023-03-18 21:16:07] [INFO ] Deduced a trap composed of 70 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:16:07] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 0 ms to minimize.
[2023-03-18 21:16:08] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 2 ms to minimize.
[2023-03-18 21:16:08] [INFO ] Deduced a trap composed of 67 places in 275 ms of which 1 ms to minimize.
[2023-03-18 21:16:08] [INFO ] Deduced a trap composed of 77 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:16:09] [INFO ] Deduced a trap composed of 41 places in 278 ms of which 1 ms to minimize.
[2023-03-18 21:16:09] [INFO ] Deduced a trap composed of 68 places in 269 ms of which 1 ms to minimize.
[2023-03-18 21:16:09] [INFO ] Deduced a trap composed of 42 places in 229 ms of which 1 ms to minimize.
[2023-03-18 21:16:10] [INFO ] Deduced a trap composed of 34 places in 259 ms of which 12 ms to minimize.
[2023-03-18 21:16:10] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 1 ms to minimize.
[2023-03-18 21:16:10] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 0 ms to minimize.
[2023-03-18 21:16:11] [INFO ] Deduced a trap composed of 40 places in 300 ms of which 1 ms to minimize.
[2023-03-18 21:16:11] [INFO ] Deduced a trap composed of 16 places in 280 ms of which 1 ms to minimize.
[2023-03-18 21:16:11] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 1 ms to minimize.
[2023-03-18 21:16:12] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 0 ms to minimize.
[2023-03-18 21:16:12] [INFO ] Deduced a trap composed of 22 places in 311 ms of which 5 ms to minimize.
[2023-03-18 21:16:12] [INFO ] Deduced a trap composed of 16 places in 307 ms of which 2 ms to minimize.
[2023-03-18 21:16:13] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2023-03-18 21:16:13] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 2 ms to minimize.
[2023-03-18 21:16:13] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 13 ms to minimize.
[2023-03-18 21:16:14] [INFO ] Deduced a trap composed of 40 places in 286 ms of which 2 ms to minimize.
[2023-03-18 21:16:14] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 1 ms to minimize.
[2023-03-18 21:16:14] [INFO ] Deduced a trap composed of 51 places in 299 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:16:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:16:14] [INFO ] After 25251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 10 out of 606 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 606/606 places, 1710/1710 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 606 transition count 1708
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 604 transition count 1708
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 604 transition count 1706
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 602 transition count 1706
Applied a total of 8 rules in 106 ms. Remains 602 /606 variables (removed 4) and now considering 1706/1710 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 602/606 places, 1706/1710 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 232 ms. (steps per millisecond=43 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 332478 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{5=1}
Probabilistic random walk after 332478 steps, saw 56804 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :1
Running SMT prover for 6 properties.
[2023-03-18 21:16:18] [INFO ] Flow matrix only has 1370 transitions (discarded 336 similar events)
// Phase 1: matrix 1370 rows 602 cols
[2023-03-18 21:16:18] [INFO ] Computed 31 place invariants in 6 ms
[2023-03-18 21:16:18] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:16:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:16:19] [INFO ] After 682ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-18 21:16:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:16:20] [INFO ] After 397ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:16:20] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:16:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:16:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:16:20] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:16:21] [INFO ] After 361ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:16:21] [INFO ] Deduced a trap composed of 11 places in 467 ms of which 1 ms to minimize.
[2023-03-18 21:16:22] [INFO ] Deduced a trap composed of 54 places in 452 ms of which 1 ms to minimize.
[2023-03-18 21:16:22] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 1 ms to minimize.
[2023-03-18 21:16:23] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 1 ms to minimize.
[2023-03-18 21:16:23] [INFO ] Deduced a trap composed of 12 places in 408 ms of which 1 ms to minimize.
[2023-03-18 21:16:24] [INFO ] Deduced a trap composed of 29 places in 416 ms of which 1 ms to minimize.
[2023-03-18 21:16:24] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2023-03-18 21:16:25] [INFO ] Deduced a trap composed of 31 places in 423 ms of which 1 ms to minimize.
[2023-03-18 21:16:25] [INFO ] Deduced a trap composed of 29 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:16:26] [INFO ] Deduced a trap composed of 37 places in 433 ms of which 1 ms to minimize.
[2023-03-18 21:16:26] [INFO ] Deduced a trap composed of 45 places in 426 ms of which 1 ms to minimize.
[2023-03-18 21:16:26] [INFO ] Deduced a trap composed of 32 places in 444 ms of which 1 ms to minimize.
[2023-03-18 21:16:27] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 1 ms to minimize.
[2023-03-18 21:16:27] [INFO ] Deduced a trap composed of 43 places in 446 ms of which 1 ms to minimize.
[2023-03-18 21:16:28] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 1 ms to minimize.
[2023-03-18 21:16:28] [INFO ] Deduced a trap composed of 20 places in 419 ms of which 1 ms to minimize.
[2023-03-18 21:16:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7688 ms
[2023-03-18 21:16:29] [INFO ] Deduced a trap composed of 86 places in 428 ms of which 1 ms to minimize.
[2023-03-18 21:16:30] [INFO ] Deduced a trap composed of 35 places in 428 ms of which 1 ms to minimize.
[2023-03-18 21:16:30] [INFO ] Deduced a trap composed of 64 places in 391 ms of which 0 ms to minimize.
[2023-03-18 21:16:30] [INFO ] Deduced a trap composed of 89 places in 427 ms of which 1 ms to minimize.
[2023-03-18 21:16:31] [INFO ] Deduced a trap composed of 70 places in 417 ms of which 0 ms to minimize.
[2023-03-18 21:16:31] [INFO ] Deduced a trap composed of 31 places in 413 ms of which 1 ms to minimize.
[2023-03-18 21:16:32] [INFO ] Deduced a trap composed of 64 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:16:32] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:16:33] [INFO ] Deduced a trap composed of 58 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:16:33] [INFO ] Deduced a trap composed of 21 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:16:34] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 1 ms to minimize.
[2023-03-18 21:16:34] [INFO ] Deduced a trap composed of 20 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:16:34] [INFO ] Deduced a trap composed of 48 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:16:35] [INFO ] Deduced a trap composed of 40 places in 396 ms of which 1 ms to minimize.
[2023-03-18 21:16:35] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:16:36] [INFO ] Deduced a trap composed of 55 places in 417 ms of which 1 ms to minimize.
[2023-03-18 21:16:37] [INFO ] Deduced a trap composed of 48 places in 415 ms of which 1 ms to minimize.
[2023-03-18 21:16:37] [INFO ] Deduced a trap composed of 20 places in 420 ms of which 1 ms to minimize.
[2023-03-18 21:16:38] [INFO ] Deduced a trap composed of 75 places in 418 ms of which 1 ms to minimize.
[2023-03-18 21:16:38] [INFO ] Deduced a trap composed of 41 places in 395 ms of which 0 ms to minimize.
[2023-03-18 21:16:39] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:16:39] [INFO ] Deduced a trap composed of 41 places in 387 ms of which 1 ms to minimize.
[2023-03-18 21:16:39] [INFO ] Deduced a trap composed of 59 places in 402 ms of which 0 ms to minimize.
[2023-03-18 21:16:40] [INFO ] Deduced a trap composed of 40 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:16:40] [INFO ] Deduced a trap composed of 30 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:16:41] [INFO ] Deduced a trap composed of 50 places in 341 ms of which 0 ms to minimize.
[2023-03-18 21:16:41] [INFO ] Deduced a trap composed of 49 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:16:42] [INFO ] Deduced a trap composed of 59 places in 341 ms of which 0 ms to minimize.
[2023-03-18 21:16:42] [INFO ] Deduced a trap composed of 50 places in 336 ms of which 1 ms to minimize.
[2023-03-18 21:16:42] [INFO ] Deduced a trap composed of 59 places in 346 ms of which 1 ms to minimize.
[2023-03-18 21:16:43] [INFO ] Deduced a trap composed of 107 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:16:43] [INFO ] Deduced a trap composed of 68 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:16:43] [INFO ] Deduced a trap composed of 67 places in 342 ms of which 1 ms to minimize.
[2023-03-18 21:16:44] [INFO ] Deduced a trap composed of 42 places in 348 ms of which 0 ms to minimize.
[2023-03-18 21:16:44] [INFO ] Deduced a trap composed of 23 places in 402 ms of which 1 ms to minimize.
[2023-03-18 21:16:45] [INFO ] Deduced a trap composed of 20 places in 416 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:16:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:16:45] [INFO ] After 25255ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 1706/1706 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 602 transition count 1705
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 601 transition count 1705
Applied a total of 2 rules in 53 ms. Remains 601 /602 variables (removed 1) and now considering 1705/1706 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 601/602 places, 1705/1706 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 324333 steps, run timeout after 3001 ms. (steps per millisecond=108 ) properties seen :{}
Probabilistic random walk after 324333 steps, saw 55515 distinct states, run finished after 3002 ms. (steps per millisecond=108 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-18 21:16:48] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 601 cols
[2023-03-18 21:16:48] [INFO ] Computed 31 place invariants in 12 ms
[2023-03-18 21:16:49] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-18 21:16:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:16:49] [INFO ] After 660ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2023-03-18 21:16:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:16:50] [INFO ] After 425ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:16:50] [INFO ] After 1395ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:16:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:16:50] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:16:51] [INFO ] After 645ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:16:51] [INFO ] After 387ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:16:52] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 1 ms to minimize.
[2023-03-18 21:16:52] [INFO ] Deduced a trap composed of 11 places in 448 ms of which 0 ms to minimize.
[2023-03-18 21:16:53] [INFO ] Deduced a trap composed of 11 places in 449 ms of which 1 ms to minimize.
[2023-03-18 21:16:53] [INFO ] Deduced a trap composed of 11 places in 433 ms of which 1 ms to minimize.
[2023-03-18 21:16:53] [INFO ] Deduced a trap composed of 32 places in 440 ms of which 1 ms to minimize.
[2023-03-18 21:16:54] [INFO ] Deduced a trap composed of 21 places in 443 ms of which 1 ms to minimize.
[2023-03-18 21:16:54] [INFO ] Deduced a trap composed of 22 places in 433 ms of which 1 ms to minimize.
[2023-03-18 21:16:55] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:16:55] [INFO ] Deduced a trap composed of 29 places in 453 ms of which 1 ms to minimize.
[2023-03-18 21:16:56] [INFO ] Deduced a trap composed of 32 places in 439 ms of which 0 ms to minimize.
[2023-03-18 21:16:56] [INFO ] Deduced a trap composed of 38 places in 441 ms of which 1 ms to minimize.
[2023-03-18 21:16:57] [INFO ] Deduced a trap composed of 30 places in 410 ms of which 0 ms to minimize.
[2023-03-18 21:16:57] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 1 ms to minimize.
[2023-03-18 21:16:58] [INFO ] Deduced a trap composed of 67 places in 437 ms of which 1 ms to minimize.
[2023-03-18 21:16:58] [INFO ] Deduced a trap composed of 13 places in 430 ms of which 1 ms to minimize.
[2023-03-18 21:16:59] [INFO ] Deduced a trap composed of 21 places in 411 ms of which 1 ms to minimize.
[2023-03-18 21:16:59] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7749 ms
[2023-03-18 21:16:59] [INFO ] Deduced a trap composed of 22 places in 413 ms of which 1 ms to minimize.
[2023-03-18 21:17:00] [INFO ] Deduced a trap composed of 25 places in 413 ms of which 1 ms to minimize.
[2023-03-18 21:17:00] [INFO ] Deduced a trap composed of 21 places in 414 ms of which 1 ms to minimize.
[2023-03-18 21:17:01] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 2 ms to minimize.
[2023-03-18 21:17:01] [INFO ] Deduced a trap composed of 35 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:17:02] [INFO ] Deduced a trap composed of 55 places in 436 ms of which 0 ms to minimize.
[2023-03-18 21:17:02] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:17:02] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:17:03] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 0 ms to minimize.
[2023-03-18 21:17:03] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:17:04] [INFO ] Deduced a trap composed of 34 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:17:04] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 0 ms to minimize.
[2023-03-18 21:17:05] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 0 ms to minimize.
[2023-03-18 21:17:05] [INFO ] Deduced a trap composed of 49 places in 336 ms of which 0 ms to minimize.
[2023-03-18 21:17:05] [INFO ] Deduced a trap composed of 98 places in 325 ms of which 1 ms to minimize.
[2023-03-18 21:17:06] [INFO ] Deduced a trap composed of 43 places in 339 ms of which 1 ms to minimize.
[2023-03-18 21:17:06] [INFO ] Deduced a trap composed of 42 places in 327 ms of which 1 ms to minimize.
[2023-03-18 21:17:07] [INFO ] Deduced a trap composed of 25 places in 280 ms of which 1 ms to minimize.
[2023-03-18 21:17:07] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 0 ms to minimize.
[2023-03-18 21:17:07] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 0 ms to minimize.
[2023-03-18 21:17:08] [INFO ] Deduced a trap composed of 55 places in 292 ms of which 0 ms to minimize.
[2023-03-18 21:17:08] [INFO ] Deduced a trap composed of 12 places in 297 ms of which 0 ms to minimize.
[2023-03-18 21:17:09] [INFO ] Deduced a trap composed of 16 places in 302 ms of which 1 ms to minimize.
[2023-03-18 21:17:09] [INFO ] Deduced a trap composed of 68 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:17:09] [INFO ] Deduced a trap composed of 68 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:17:10] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 0 ms to minimize.
[2023-03-18 21:17:10] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 0 ms to minimize.
[2023-03-18 21:17:10] [INFO ] Deduced a trap composed of 65 places in 258 ms of which 1 ms to minimize.
[2023-03-18 21:17:11] [INFO ] Deduced a trap composed of 60 places in 237 ms of which 0 ms to minimize.
[2023-03-18 21:17:11] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 1 ms to minimize.
[2023-03-18 21:17:11] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 1 ms to minimize.
[2023-03-18 21:17:12] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 1 ms to minimize.
[2023-03-18 21:17:12] [INFO ] Deduced a trap composed of 17 places in 264 ms of which 1 ms to minimize.
[2023-03-18 21:17:12] [INFO ] Deduced a trap composed of 13 places in 264 ms of which 1 ms to minimize.
[2023-03-18 21:17:13] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 1 ms to minimize.
[2023-03-18 21:17:13] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 1 ms to minimize.
[2023-03-18 21:17:13] [INFO ] Deduced a trap composed of 50 places in 213 ms of which 1 ms to minimize.
[2023-03-18 21:17:14] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2023-03-18 21:17:14] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 0 ms to minimize.
[2023-03-18 21:17:14] [INFO ] Deduced a trap composed of 22 places in 249 ms of which 0 ms to minimize.
[2023-03-18 21:17:15] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.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.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:17:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:17:15] [INFO ] After 25059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:6
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 42 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 601/601 places, 1705/1705 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 36 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2023-03-18 21:17:15] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
[2023-03-18 21:17:15] [INFO ] Invariant cache hit.
[2023-03-18 21:17:16] [INFO ] Implicit Places using invariants in 1034 ms returned [585, 586, 587, 588, 589, 598, 599]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1047 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 594/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 47 ms. Remains 594 /594 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1140 ms. Remains : 594/601 places, 1705/1705 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(!p0))))'
Support contains 48 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1992 transition count 2206
Reduce places removed 890 places and 0 transitions.
Iterating post reduction 1 with 890 rules applied. Total rules applied 1780 place count 1102 transition count 2206
Performed 406 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 406 Pre rules applied. Total rules applied 1780 place count 1102 transition count 1800
Deduced a syphon composed of 406 places in 1 ms
Reduce places removed 406 places and 0 transitions.
Iterating global reduction 2 with 812 rules applied. Total rules applied 2592 place count 696 transition count 1800
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 2608 place count 688 transition count 1792
Applied a total of 2608 rules in 299 ms. Remains 688 /1992 variables (removed 1304) and now considering 1792/3096 (removed 1304) transitions.
[2023-03-18 21:17:17] [INFO ] Flow matrix only has 1456 transitions (discarded 336 similar events)
// Phase 1: matrix 1456 rows 688 cols
[2023-03-18 21:17:17] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-18 21:17:18] [INFO ] Implicit Places using invariants in 1380 ms returned [672, 673, 674, 675, 676, 685, 686, 687]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1397 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 680/1992 places, 1792/3096 transitions.
Applied a total of 0 rules in 40 ms. Remains 680 /680 variables (removed 0) and now considering 1792/1792 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1737 ms. Remains : 680/1992 places, 1792/3096 transitions.
Stuttering acceptance computed with spot in 293 ms :[false]
Running random walk in product with property : Peterson-PT-7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s394 1) (EQ s393 1) (EQ s392 1) (EQ s391 1) (EQ s390 1) (EQ s389 1) (EQ s388 1) (EQ s387 1) (EQ s402 1) (EQ s401 1) (EQ s400 1) (EQ s399 1) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 840 ms.
Stack based approach found an accepted trace after 1832 steps with 0 reset with depth 1833 and stack size 1582 in 19 ms.
FORMULA Peterson-PT-7-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-00 finished in 3023 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 16 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 110 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:17:20] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:17:20] [INFO ] Computed 31 place invariants in 26 ms
[2023-03-18 21:17:21] [INFO ] Implicit Places using invariants in 1239 ms returned []
[2023-03-18 21:17:21] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:21] [INFO ] Invariant cache hit.
[2023-03-18 21:17:22] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 2324 ms to find 0 implicit places.
[2023-03-18 21:17:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:22] [INFO ] Invariant cache hit.
[2023-03-18 21:17:25] [INFO ] Dead Transitions using invariants and state equation in 2669 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5119 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (NEQ s1016 1) (NEQ s1927 1)) (OR (NEQ s896 1) (NEQ s1921 1)) (OR (NEQ s895 1) (NEQ s1922 1)) (OR (NEQ s894 1) (NEQ s1923 1)) (OR (NEQ s893 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 365 steps with 0 reset in 3 ms.
FORMULA Peterson-PT-7-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-01 finished in 5413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G(p1)))'
Support contains 168 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:17:25] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:25] [INFO ] Invariant cache hit.
[2023-03-18 21:17:26] [INFO ] Implicit Places using invariants in 1113 ms returned []
[2023-03-18 21:17:26] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:26] [INFO ] Invariant cache hit.
[2023-03-18 21:17:27] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2023-03-18 21:17:27] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:27] [INFO ] Invariant cache hit.
[2023-03-18 21:17:30] [INFO ] Dead Transitions using invariants and state equation in 2658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4762 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 3}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s1289 1) (EQ s1823 1)) (AND (EQ s1283 1) (EQ s1820 1)) (AND (EQ s1287 1) (EQ s1811 1)) (AND (EQ s1333 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-02 finished in 5160 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((F(p1)&&p0))&&X(p2))))'
Support contains 904 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 25 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:17:30] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:30] [INFO ] Invariant cache hit.
[2023-03-18 21:17:31] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2023-03-18 21:17:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:31] [INFO ] Invariant cache hit.
[2023-03-18 21:17:33] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 2303 ms to find 0 implicit places.
[2023-03-18 21:17:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:33] [INFO ] Invariant cache hit.
[2023-03-18 21:17:35] [INFO ] Dead Transitions using invariants and state equation in 2700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5039 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1626 0) (EQ s1431 0) (EQ s1886 0) (EQ s1691 0) (EQ s1756 0) (EQ s1610 0) (EQ s1675 0) (EQ s1870 0) (EQ s1480 0) (EQ s1463 0) (EQ s1723 0) (EQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5781 ms.
Product exploration explored 100000 steps with 50000 reset in 5749 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p1), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p2)
Knowledge based reduction with 13 factoid took 378 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-7-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-7-LTLFireability-04 finished in 17257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 120 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 84 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:17:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:48] [INFO ] Invariant cache hit.
[2023-03-18 21:17:49] [INFO ] Implicit Places using invariants in 951 ms returned []
[2023-03-18 21:17:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:49] [INFO ] Invariant cache hit.
[2023-03-18 21:17:49] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
[2023-03-18 21:17:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:50] [INFO ] Invariant cache hit.
[2023-03-18 21:17:52] [INFO ] Dead Transitions using invariants and state equation in 2697 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4751 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s487 1) (EQ s486 1) (EQ s485 1) (EQ s483 1) (EQ s482 1) (EQ s481 1) (EQ s492 1) (EQ s488 1)), p0:(OR (AND (EQ s1492 1) (EQ s1791 1)) (AND (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-06 finished in 4894 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(((p0 U p1)&&!p0) U G(p0))&&X(p1)))))'
Support contains 464 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 55 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:17:52] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:52] [INFO ] Invariant cache hit.
[2023-03-18 21:17:54] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2023-03-18 21:17:54] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:54] [INFO ] Invariant cache hit.
[2023-03-18 21:17:55] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2023-03-18 21:17:55] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:17:55] [INFO ] Invariant cache hit.
[2023-03-18 21:17:57] [INFO ] Dead Transitions using invariants and state equation in 2604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5017 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0, p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (EQ s1020 1) (EQ s1979 1)) (AND (EQ s1006 1) (EQ s1989 1)) (AND (EQ s1013 1) (EQ s1980 1)) (AND (EQ s1007 1) (EQ s1990 1)) (AND (EQ s1008 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4458 reset in 807 ms.
Stack based approach found an accepted trace after 3853 steps with 172 reset with depth 20 and stack size 20 in 32 ms.
FORMULA Peterson-PT-7-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-07 finished in 6101 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U p1)))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 447 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 447 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1753
Deduced a syphon composed of 447 places in 1 ms
Reduce places removed 447 places and 0 transitions.
Iterating global reduction 2 with 894 rules applied. Total rules applied 2686 place count 649 transition count 1753
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 1 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 108 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 331 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-18 21:17:59] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-18 21:17:59] [INFO ] Computed 31 place invariants in 5 ms
[2023-03-18 21:18:00] [INFO ] Implicit Places using invariants in 974 ms returned [579, 580, 581, 582, 583, 592, 593, 594]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 989 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 587/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 54 ms. Remains 587 /587 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1380 ms. Remains : 587/1992 places, 1699/3096 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s330 1) (EQ s353 1)), p0:(AND (EQ s516 1) (EQ s552 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 366 ms.
Stack based approach found an accepted trace after 40 steps with 0 reset with depth 41 and stack size 41 in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-08 finished in 2089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2796 place count 594 transition count 1698
Applied a total of 2796 rules in 153 ms. Remains 594 /1992 variables (removed 1398) and now considering 1698/3096 (removed 1398) transitions.
[2023-03-18 21:18:01] [INFO ] Flow matrix only has 1362 transitions (discarded 336 similar events)
// Phase 1: matrix 1362 rows 594 cols
[2023-03-18 21:18:01] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-18 21:18:02] [INFO ] Implicit Places using invariants in 1168 ms returned [578, 579, 580, 581, 582, 591, 592, 593]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1179 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 586/1992 places, 1698/3096 transitions.
Applied a total of 0 rules in 28 ms. Remains 586 /586 variables (removed 0) and now considering 1698/1698 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1363 ms. Remains : 586/1992 places, 1698/3096 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s473 1) (EQ s561 1)) (AND (EQ s563 1) (EQ s574 1))), p1:(OR (EQ s458 0) (EQ s573 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Stack based approach found an accepted trace after 1324 steps with 0 reset with depth 1325 and stack size 1133 in 6 ms.
FORMULA Peterson-PT-7-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-09 finished in 1870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p1||(p2 U p3)))||p0)))'
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 86 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:18:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:18:03] [INFO ] Computed 31 place invariants in 11 ms
[2023-03-18 21:18:04] [INFO ] Implicit Places using invariants in 1111 ms returned []
[2023-03-18 21:18:04] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:18:04] [INFO ] Invariant cache hit.
[2023-03-18 21:18:05] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2023-03-18 21:18:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:18:05] [INFO ] Invariant cache hit.
[2023-03-18 21:18:07] [INFO ] Dead Transitions using invariants and state equation in 2645 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4981 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s894 0) (EQ s1923 0) (EQ s1749 0)), p1:(EQ s1749 0), p3:(AND (EQ s1822 1) (EQ s1961 1)), p2:(EQ s1749 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 458 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 319 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) 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 5) seen :0
Interrupted probabilistic random walk after 123120 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123120 steps, saw 79081 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-18 21:18:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:18:13] [INFO ] Invariant cache hit.
[2023-03-18 21:18:13] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-18 21:18:13] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2023-03-18 21:18:15] [INFO ] After 1584ms SMT Verify possible using state equation in real domain returned unsat :1 sat :2 real:2
[2023-03-18 21:18:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:18:15] [INFO ] After 436ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-18 21:18:15] [INFO ] After 2723ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-18 21:18:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-18 21:18:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-18 21:18:18] [INFO ] After 1839ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-18 21:18:19] [INFO ] After 810ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-18 21:18:20] [INFO ] Deduced a trap composed of 57 places in 1683 ms of which 2 ms to minimize.
[2023-03-18 21:18:22] [INFO ] Deduced a trap composed of 58 places in 1800 ms of which 3 ms to minimize.
[2023-03-18 21:18:24] [INFO ] Deduced a trap composed of 20 places in 1587 ms of which 2 ms to minimize.
[2023-03-18 21:18:26] [INFO ] Deduced a trap composed of 17 places in 1641 ms of which 2 ms to minimize.
[2023-03-18 21:18:27] [INFO ] Deduced a trap composed of 92 places in 1384 ms of which 1 ms to minimize.
[2023-03-18 21:18:29] [INFO ] Deduced a trap composed of 92 places in 1367 ms of which 1 ms to minimize.
[2023-03-18 21:18:30] [INFO ] Deduced a trap composed of 89 places in 1397 ms of which 2 ms to minimize.
[2023-03-18 21:18:32] [INFO ] Deduced a trap composed of 119 places in 1239 ms of which 1 ms to minimize.
[2023-03-18 21:18:33] [INFO ] Deduced a trap composed of 122 places in 1244 ms of which 2 ms to minimize.
[2023-03-18 21:18:35] [INFO ] Deduced a trap composed of 123 places in 1220 ms of which 2 ms to minimize.
[2023-03-18 21:18:36] [INFO ] Deduced a trap composed of 186 places in 1136 ms of which 1 ms to minimize.
[2023-03-18 21:18:37] [INFO ] Deduced a trap composed of 224 places in 1165 ms of which 2 ms to minimize.
[2023-03-18 21:18:39] [INFO ] Deduced a trap composed of 190 places in 1147 ms of which 1 ms to minimize.
[2023-03-18 21:18:40] [INFO ] Deduced a trap composed of 157 places in 1157 ms of which 2 ms to minimize.
[2023-03-18 21:18:41] [INFO ] Deduced a trap composed of 191 places in 1177 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:18:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:18:41] [INFO ] After 26007ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 178 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:18:42] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-18 21:18:42] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-18 21:18:42] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:18:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:18:42] [INFO ] After 286ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:18:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:18:42] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:18:43] [INFO ] After 531ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:18:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:18:43] [INFO ] After 273ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:18:43] [INFO ] Deduced a trap composed of 40 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:18:44] [INFO ] Deduced a trap composed of 39 places in 417 ms of which 1 ms to minimize.
[2023-03-18 21:18:44] [INFO ] Deduced a trap composed of 13 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:18:45] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2023-03-18 21:18:45] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2023-03-18 21:18:46] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 0 ms to minimize.
[2023-03-18 21:18:46] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:18:47] [INFO ] Deduced a trap composed of 31 places in 367 ms of which 0 ms to minimize.
[2023-03-18 21:18:47] [INFO ] Deduced a trap composed of 21 places in 358 ms of which 0 ms to minimize.
[2023-03-18 21:18:47] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 1 ms to minimize.
[2023-03-18 21:18:48] [INFO ] Deduced a trap composed of 66 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:18:48] [INFO ] Deduced a trap composed of 25 places in 347 ms of which 0 ms to minimize.
[2023-03-18 21:18:49] [INFO ] Deduced a trap composed of 31 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:18:49] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:18:50] [INFO ] Deduced a trap composed of 14 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:18:50] [INFO ] Deduced a trap composed of 41 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:18:50] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 1 ms to minimize.
[2023-03-18 21:18:51] [INFO ] Deduced a trap composed of 32 places in 359 ms of which 0 ms to minimize.
[2023-03-18 21:18:51] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 0 ms to minimize.
[2023-03-18 21:18:52] [INFO ] Deduced a trap composed of 40 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:18:52] [INFO ] Deduced a trap composed of 58 places in 325 ms of which 1 ms to minimize.
[2023-03-18 21:18:52] [INFO ] Deduced a trap composed of 57 places in 320 ms of which 0 ms to minimize.
[2023-03-18 21:18:53] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:18:53] [INFO ] Deduced a trap composed of 55 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:18:54] [INFO ] Deduced a trap composed of 25 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:18:54] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:18:55] [INFO ] Deduced a trap composed of 20 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:18:55] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:18:55] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 1 ms to minimize.
[2023-03-18 21:18:56] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 0 ms to minimize.
[2023-03-18 21:18:56] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 1 ms to minimize.
[2023-03-18 21:18:56] [INFO ] Deduced a trap composed of 49 places in 303 ms of which 1 ms to minimize.
[2023-03-18 21:18:57] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 1 ms to minimize.
[2023-03-18 21:18:57] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 0 ms to minimize.
[2023-03-18 21:18:58] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 0 ms to minimize.
[2023-03-18 21:18:58] [INFO ] Deduced a trap composed of 67 places in 287 ms of which 1 ms to minimize.
[2023-03-18 21:18:58] [INFO ] Deduced a trap composed of 67 places in 286 ms of which 2 ms to minimize.
[2023-03-18 21:18:59] [INFO ] Deduced a trap composed of 55 places in 276 ms of which 0 ms to minimize.
[2023-03-18 21:18:59] [INFO ] Deduced a trap composed of 49 places in 301 ms of which 0 ms to minimize.
[2023-03-18 21:18:59] [INFO ] Deduced a trap composed of 49 places in 282 ms of which 0 ms to minimize.
[2023-03-18 21:19:00] [INFO ] Deduced a trap composed of 45 places in 307 ms of which 1 ms to minimize.
[2023-03-18 21:19:00] [INFO ] Deduced a trap composed of 30 places in 328 ms of which 0 ms to minimize.
[2023-03-18 21:19:01] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2023-03-18 21:19:01] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:19:01] [INFO ] Deduced a trap composed of 84 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:19:02] [INFO ] Deduced a trap composed of 67 places in 314 ms of which 0 ms to minimize.
[2023-03-18 21:19:02] [INFO ] Deduced a trap composed of 67 places in 325 ms of which 0 ms to minimize.
[2023-03-18 21:19:03] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:19:03] [INFO ] Deduced a trap composed of 49 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:19:03] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:19:04] [INFO ] Deduced a trap composed of 41 places in 388 ms of which 1 ms to minimize.
[2023-03-18 21:19:04] [INFO ] Deduced a trap composed of 65 places in 358 ms of which 0 ms to minimize.
[2023-03-18 21:19:05] [INFO ] Deduced a trap composed of 23 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:19:05] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 3 ms to minimize.
[2023-03-18 21:19:05] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 0 ms to minimize.
[2023-03-18 21:19:06] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 2 ms to minimize.
[2023-03-18 21:19:06] [INFO ] Deduced a trap composed of 67 places in 240 ms of which 2 ms to minimize.
[2023-03-18 21:19:07] [INFO ] Deduced a trap composed of 20 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:19:07] [INFO ] Deduced a trap composed of 11 places in 384 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:19:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:19:07] [INFO ] After 25150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 596/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 382383 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :{}
Probabilistic random walk after 382383 steps, saw 60580 distinct states, run finished after 3001 ms. (steps per millisecond=127 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:19:10] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:19:10] [INFO ] Invariant cache hit.
[2023-03-18 21:19:11] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:19:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:19:11] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:19:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:19:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:19:11] [INFO ] After 529ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:19:11] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:19:12] [INFO ] After 236ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:19:12] [INFO ] Deduced a trap composed of 13 places in 373 ms of which 2 ms to minimize.
[2023-03-18 21:19:12] [INFO ] Deduced a trap composed of 35 places in 396 ms of which 4 ms to minimize.
[2023-03-18 21:19:13] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:19:13] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:19:14] [INFO ] Deduced a trap composed of 13 places in 394 ms of which 0 ms to minimize.
[2023-03-18 21:19:14] [INFO ] Deduced a trap composed of 12 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:19:15] [INFO ] Deduced a trap composed of 14 places in 382 ms of which 1 ms to minimize.
[2023-03-18 21:19:15] [INFO ] Deduced a trap composed of 16 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:19:15] [INFO ] Deduced a trap composed of 30 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:19:16] [INFO ] Deduced a trap composed of 27 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:19:16] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:19:17] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:19:17] [INFO ] Deduced a trap composed of 45 places in 321 ms of which 1 ms to minimize.
[2023-03-18 21:19:17] [INFO ] Deduced a trap composed of 66 places in 328 ms of which 0 ms to minimize.
[2023-03-18 21:19:18] [INFO ] Deduced a trap composed of 40 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:19:18] [INFO ] Deduced a trap composed of 30 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:19:19] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:19:19] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:19:19] [INFO ] Deduced a trap composed of 55 places in 268 ms of which 1 ms to minimize.
[2023-03-18 21:19:20] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 1 ms to minimize.
[2023-03-18 21:19:20] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 1 ms to minimize.
[2023-03-18 21:19:20] [INFO ] Deduced a trap composed of 40 places in 312 ms of which 0 ms to minimize.
[2023-03-18 21:19:21] [INFO ] Deduced a trap composed of 48 places in 267 ms of which 1 ms to minimize.
[2023-03-18 21:19:21] [INFO ] Deduced a trap composed of 32 places in 362 ms of which 1 ms to minimize.
[2023-03-18 21:19:22] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:19:22] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 1 ms to minimize.
[2023-03-18 21:19:22] [INFO ] Deduced a trap composed of 49 places in 289 ms of which 0 ms to minimize.
[2023-03-18 21:19:23] [INFO ] Deduced a trap composed of 45 places in 320 ms of which 0 ms to minimize.
[2023-03-18 21:19:23] [INFO ] Deduced a trap composed of 49 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:19:23] [INFO ] Deduced a trap composed of 65 places in 330 ms of which 1 ms to minimize.
[2023-03-18 21:19:24] [INFO ] Deduced a trap composed of 58 places in 349 ms of which 0 ms to minimize.
[2023-03-18 21:19:24] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 1 ms to minimize.
[2023-03-18 21:19:25] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 1 ms to minimize.
[2023-03-18 21:19:25] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 1 ms to minimize.
[2023-03-18 21:19:25] [INFO ] Deduced a trap composed of 68 places in 312 ms of which 0 ms to minimize.
[2023-03-18 21:19:26] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 0 ms to minimize.
[2023-03-18 21:19:26] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 0 ms to minimize.
[2023-03-18 21:19:26] [INFO ] Deduced a trap composed of 81 places in 313 ms of which 0 ms to minimize.
[2023-03-18 21:19:27] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:19:27] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:19:28] [INFO ] Deduced a trap composed of 67 places in 290 ms of which 1 ms to minimize.
[2023-03-18 21:19:28] [INFO ] Deduced a trap composed of 12 places in 279 ms of which 0 ms to minimize.
[2023-03-18 21:19:28] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:19:29] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:19:29] [INFO ] Deduced a trap composed of 60 places in 393 ms of which 1 ms to minimize.
[2023-03-18 21:19:30] [INFO ] Deduced a trap composed of 31 places in 373 ms of which 1 ms to minimize.
[2023-03-18 21:19:30] [INFO ] Deduced a trap composed of 28 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:19:31] [INFO ] Deduced a trap composed of 68 places in 346 ms of which 1 ms to minimize.
[2023-03-18 21:19:31] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:19:31] [INFO ] Deduced a trap composed of 22 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:19:32] [INFO ] Deduced a trap composed of 49 places in 339 ms of which 1 ms to minimize.
[2023-03-18 21:19:32] [INFO ] Deduced a trap composed of 73 places in 321 ms of which 1 ms to minimize.
[2023-03-18 21:19:33] [INFO ] Deduced a trap composed of 21 places in 314 ms of which 0 ms to minimize.
[2023-03-18 21:19:33] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 0 ms to minimize.
[2023-03-18 21:19:33] [INFO ] Deduced a trap composed of 40 places in 320 ms of which 1 ms to minimize.
[2023-03-18 21:19:34] [INFO ] Deduced a trap composed of 75 places in 233 ms of which 0 ms to minimize.
[2023-03-18 21:19:34] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 1 ms to minimize.
[2023-03-18 21:19:34] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 0 ms to minimize.
[2023-03-18 21:19:35] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 1 ms to minimize.
[2023-03-18 21:19:35] [INFO ] Deduced a trap composed of 22 places in 312 ms of which 1 ms to minimize.
[2023-03-18 21:19:36] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:19:36] [INFO ] Deduced a trap composed of 34 places in 317 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:19:36] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:19:36] [INFO ] After 25304ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 26 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:19:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:19:36] [INFO ] Invariant cache hit.
[2023-03-18 21:19:37] [INFO ] Implicit Places using invariants in 703 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 723 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 775 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 415737 steps, run timeout after 3001 ms. (steps per millisecond=138 ) properties seen :{}
Probabilistic random walk after 415737 steps, saw 63799 distinct states, run finished after 3001 ms. (steps per millisecond=138 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:19:40] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-18 21:19:40] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-18 21:19:40] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:19:40] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:19:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-18 21:19:41] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:19:41] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:19:41] [INFO ] After 369ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:19:42] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:19:42] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 1 ms to minimize.
[2023-03-18 21:19:43] [INFO ] Deduced a trap composed of 21 places in 387 ms of which 1 ms to minimize.
[2023-03-18 21:19:43] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2023-03-18 21:19:43] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:19:44] [INFO ] Deduced a trap composed of 14 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:19:44] [INFO ] Deduced a trap composed of 22 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:19:45] [INFO ] Deduced a trap composed of 12 places in 386 ms of which 1 ms to minimize.
[2023-03-18 21:19:45] [INFO ] Deduced a trap composed of 97 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:19:46] [INFO ] Deduced a trap composed of 40 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:19:46] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:19:47] [INFO ] Deduced a trap composed of 93 places in 373 ms of which 0 ms to minimize.
[2023-03-18 21:19:47] [INFO ] Deduced a trap composed of 12 places in 393 ms of which 1 ms to minimize.
[2023-03-18 21:19:47] [INFO ] Deduced a trap composed of 35 places in 336 ms of which 1 ms to minimize.
[2023-03-18 21:19:48] [INFO ] Deduced a trap composed of 31 places in 329 ms of which 5 ms to minimize.
[2023-03-18 21:19:48] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 1 ms to minimize.
[2023-03-18 21:19:49] [INFO ] Deduced a trap composed of 70 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:19:49] [INFO ] Deduced a trap composed of 57 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:19:49] [INFO ] Deduced a trap composed of 31 places in 345 ms of which 0 ms to minimize.
[2023-03-18 21:19:50] [INFO ] Deduced a trap composed of 40 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:19:50] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 0 ms to minimize.
[2023-03-18 21:19:51] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:19:51] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:19:51] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:19:52] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 0 ms to minimize.
[2023-03-18 21:19:52] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 0 ms to minimize.
[2023-03-18 21:19:53] [INFO ] Deduced a trap composed of 25 places in 376 ms of which 1 ms to minimize.
[2023-03-18 21:19:53] [INFO ] Deduced a trap composed of 39 places in 352 ms of which 0 ms to minimize.
[2023-03-18 21:19:54] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:19:54] [INFO ] Deduced a trap composed of 57 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:19:54] [INFO ] Deduced a trap composed of 40 places in 317 ms of which 0 ms to minimize.
[2023-03-18 21:19:55] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:19:55] [INFO ] Deduced a trap composed of 32 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:19:56] [INFO ] Deduced a trap composed of 48 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:19:56] [INFO ] Deduced a trap composed of 14 places in 379 ms of which 0 ms to minimize.
[2023-03-18 21:19:57] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:19:57] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:19:57] [INFO ] Deduced a trap composed of 31 places in 352 ms of which 0 ms to minimize.
[2023-03-18 21:19:58] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 0 ms to minimize.
[2023-03-18 21:19:58] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 0 ms to minimize.
[2023-03-18 21:19:58] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 1 ms to minimize.
[2023-03-18 21:19:59] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 0 ms to minimize.
[2023-03-18 21:19:59] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2023-03-18 21:19:59] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 1 ms to minimize.
[2023-03-18 21:20:00] [INFO ] Deduced a trap composed of 49 places in 284 ms of which 1 ms to minimize.
[2023-03-18 21:20:00] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:20:00] [INFO ] Deduced a trap composed of 58 places in 276 ms of which 0 ms to minimize.
[2023-03-18 21:20:01] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 0 ms to minimize.
[2023-03-18 21:20:01] [INFO ] Deduced a trap composed of 65 places in 236 ms of which 1 ms to minimize.
[2023-03-18 21:20:01] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 1 ms to minimize.
[2023-03-18 21:20:02] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 1 ms to minimize.
[2023-03-18 21:20:02] [INFO ] Deduced a trap composed of 55 places in 406 ms of which 0 ms to minimize.
[2023-03-18 21:20:03] [INFO ] Deduced a trap composed of 14 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:20:03] [INFO ] Deduced a trap composed of 39 places in 367 ms of which 0 ms to minimize.
[2023-03-18 21:20:03] [INFO ] Deduced a trap composed of 40 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:20:04] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:20:04] [INFO ] Deduced a trap composed of 31 places in 310 ms of which 0 ms to minimize.
[2023-03-18 21:20:05] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 0 ms to minimize.
[2023-03-18 21:20:05] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 1 ms to minimize.
[2023-03-18 21:20:05] [INFO ] Deduced a trap composed of 67 places in 188 ms of which 1 ms to minimize.
[2023-03-18 21:20:05] [INFO ] Trap strengthening (SAT) tested/added 60/60 trap constraints in 23869 ms
[2023-03-18 21:20:05] [INFO ] After 24262ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 21:20:05] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:20:05] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:20:05] [INFO ] Invariant cache hit.
[2023-03-18 21:20:06] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-18 21:20:06] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:20:06] [INFO ] Invariant cache hit.
[2023-03-18 21:20:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:20:10] [INFO ] Implicit Places using invariants and state equation in 4583 ms returned []
Implicit Place search using SMT with State Equation took 5342 ms to find 0 implicit places.
[2023-03-18 21:20:11] [INFO ] Redundant transitions in 261 ms returned []
[2023-03-18 21:20:11] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:20:11] [INFO ] Invariant cache hit.
[2023-03-18 21:20:12] [INFO ] Dead Transitions using invariants and state equation in 1183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6838 ms. Remains : 588/588 places, 1700/1700 transitions.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 394 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 87 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:20:13] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:20:13] [INFO ] Computed 31 place invariants in 13 ms
[2023-03-18 21:20:14] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-18 21:20:14] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:20:14] [INFO ] Invariant cache hit.
[2023-03-18 21:20:15] [INFO ] Implicit Places using invariants and state equation in 1107 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2023-03-18 21:20:15] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:20:15] [INFO ] Invariant cache hit.
[2023-03-18 21:20:18] [INFO ] Dead Transitions using invariants and state equation in 2781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5137 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 195 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:20:19] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:20:19] [INFO ] Invariant cache hit.
[2023-03-18 21:20:19] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-18 21:20:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-18 21:20:19] [INFO ] After 618ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:20:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2023-03-18 21:20:20] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:20:22] [INFO ] After 1650ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:20:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:20:22] [INFO ] After 726ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:20:24] [INFO ] Deduced a trap composed of 13 places in 1638 ms of which 2 ms to minimize.
[2023-03-18 21:20:26] [INFO ] Deduced a trap composed of 13 places in 1586 ms of which 2 ms to minimize.
[2023-03-18 21:20:27] [INFO ] Deduced a trap composed of 123 places in 1505 ms of which 2 ms to minimize.
[2023-03-18 21:20:29] [INFO ] Deduced a trap composed of 58 places in 1506 ms of which 2 ms to minimize.
[2023-03-18 21:20:31] [INFO ] Deduced a trap composed of 54 places in 1487 ms of which 1 ms to minimize.
[2023-03-18 21:20:32] [INFO ] Deduced a trap composed of 54 places in 1506 ms of which 2 ms to minimize.
[2023-03-18 21:20:34] [INFO ] Deduced a trap composed of 89 places in 1453 ms of which 2 ms to minimize.
[2023-03-18 21:20:35] [INFO ] Deduced a trap composed of 92 places in 1451 ms of which 2 ms to minimize.
[2023-03-18 21:20:37] [INFO ] Deduced a trap composed of 88 places in 1435 ms of which 2 ms to minimize.
[2023-03-18 21:20:39] [INFO ] Deduced a trap composed of 122 places in 1548 ms of which 2 ms to minimize.
[2023-03-18 21:20:41] [INFO ] Deduced a trap composed of 47 places in 1540 ms of which 2 ms to minimize.
[2023-03-18 21:20:42] [INFO ] Deduced a trap composed of 119 places in 1059 ms of which 1 ms to minimize.
[2023-03-18 21:20:44] [INFO ] Deduced a trap composed of 59 places in 1540 ms of which 2 ms to minimize.
[2023-03-18 21:20:45] [INFO ] Deduced a trap composed of 85 places in 1482 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:20:45] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:20:45] [INFO ] After 25985ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 167 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 596/1992 places, 1700/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 409581 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409581 steps, saw 63104 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:20:49] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-18 21:20:49] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-18 21:20:49] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:20:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:20:49] [INFO ] After 202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:20:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-18 21:20:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:20:50] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:20:50] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:20:50] [INFO ] After 363ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:20:50] [INFO ] Deduced a trap composed of 40 places in 476 ms of which 1 ms to minimize.
[2023-03-18 21:20:51] [INFO ] Deduced a trap composed of 39 places in 392 ms of which 1 ms to minimize.
[2023-03-18 21:20:51] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 1 ms to minimize.
[2023-03-18 21:20:52] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:20:52] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 0 ms to minimize.
[2023-03-18 21:20:53] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 1 ms to minimize.
[2023-03-18 21:20:53] [INFO ] Deduced a trap composed of 14 places in 408 ms of which 0 ms to minimize.
[2023-03-18 21:20:54] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 0 ms to minimize.
[2023-03-18 21:20:54] [INFO ] Deduced a trap composed of 21 places in 384 ms of which 0 ms to minimize.
[2023-03-18 21:20:55] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 0 ms to minimize.
[2023-03-18 21:20:55] [INFO ] Deduced a trap composed of 66 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:20:55] [INFO ] Deduced a trap composed of 25 places in 357 ms of which 0 ms to minimize.
[2023-03-18 21:20:56] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:20:56] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:20:57] [INFO ] Deduced a trap composed of 14 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:20:57] [INFO ] Deduced a trap composed of 41 places in 376 ms of which 1 ms to minimize.
[2023-03-18 21:20:58] [INFO ] Deduced a trap composed of 23 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:20:58] [INFO ] Deduced a trap composed of 32 places in 338 ms of which 0 ms to minimize.
[2023-03-18 21:20:58] [INFO ] Deduced a trap composed of 11 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:20:59] [INFO ] Deduced a trap composed of 40 places in 323 ms of which 0 ms to minimize.
[2023-03-18 21:20:59] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 0 ms to minimize.
[2023-03-18 21:21:00] [INFO ] Deduced a trap composed of 57 places in 333 ms of which 1 ms to minimize.
[2023-03-18 21:21:00] [INFO ] Deduced a trap composed of 58 places in 321 ms of which 1 ms to minimize.
[2023-03-18 21:21:00] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 1 ms to minimize.
[2023-03-18 21:21:01] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:21:01] [INFO ] Deduced a trap composed of 31 places in 332 ms of which 0 ms to minimize.
[2023-03-18 21:21:02] [INFO ] Deduced a trap composed of 20 places in 336 ms of which 0 ms to minimize.
[2023-03-18 21:21:02] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 1 ms to minimize.
[2023-03-18 21:21:02] [INFO ] Deduced a trap composed of 58 places in 322 ms of which 0 ms to minimize.
[2023-03-18 21:21:03] [INFO ] Deduced a trap composed of 52 places in 297 ms of which 1 ms to minimize.
[2023-03-18 21:21:03] [INFO ] Deduced a trap composed of 52 places in 311 ms of which 1 ms to minimize.
[2023-03-18 21:21:03] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 1 ms to minimize.
[2023-03-18 21:21:04] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 1 ms to minimize.
[2023-03-18 21:21:04] [INFO ] Deduced a trap composed of 52 places in 287 ms of which 1 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 0 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 67 places in 281 ms of which 0 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 0 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 1 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 49 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 49 places in 278 ms of which 0 ms to minimize.
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 0 ms to minimize.
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 0 ms to minimize.
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 13 places in 316 ms of which 0 ms to minimize.
[2023-03-18 21:21:08] [INFO ] Deduced a trap composed of 37 places in 373 ms of which 1 ms to minimize.
[2023-03-18 21:21:08] [INFO ] Deduced a trap composed of 84 places in 330 ms of which 0 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Deduced a trap composed of 67 places in 308 ms of which 0 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Deduced a trap composed of 67 places in 315 ms of which 0 ms to minimize.
[2023-03-18 21:21:10] [INFO ] Deduced a trap composed of 22 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:21:10] [INFO ] Deduced a trap composed of 49 places in 333 ms of which 0 ms to minimize.
[2023-03-18 21:21:10] [INFO ] Deduced a trap composed of 31 places in 314 ms of which 0 ms to minimize.
[2023-03-18 21:21:11] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:21:11] [INFO ] Deduced a trap composed of 65 places in 345 ms of which 0 ms to minimize.
[2023-03-18 21:21:12] [INFO ] Deduced a trap composed of 23 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:21:12] [INFO ] Deduced a trap composed of 49 places in 274 ms of which 1 ms to minimize.
[2023-03-18 21:21:12] [INFO ] Deduced a trap composed of 83 places in 265 ms of which 0 ms to minimize.
[2023-03-18 21:21:13] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2023-03-18 21:21:13] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 1 ms to minimize.
[2023-03-18 21:21:13] [INFO ] Deduced a trap composed of 20 places in 345 ms of which 1 ms to minimize.
[2023-03-18 21:21:14] [INFO ] Deduced a trap composed of 11 places in 362 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:21:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:21:14] [INFO ] After 25100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 596 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 596/596 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 596/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 29 ms. Remains 596 /596 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:21:14] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:21:14] [INFO ] Invariant cache hit.
[2023-03-18 21:21:15] [INFO ] Implicit Places using invariants in 807 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 819 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/596 places, 1700/1700 transitions.
Applied a total of 0 rules in 32 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 881 ms. Remains : 588/596 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 401895 steps, run timeout after 3001 ms. (steps per millisecond=133 ) properties seen :{}
Probabilistic random walk after 401895 steps, saw 62363 distinct states, run finished after 3001 ms. (steps per millisecond=133 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:21:18] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-18 21:21:18] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-18 21:21:18] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:21:18] [INFO ] After 229ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:21:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:21:19] [INFO ] After 521ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:21:19] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:21:19] [INFO ] After 206ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:21:20] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 0 ms to minimize.
[2023-03-18 21:21:20] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:21:21] [INFO ] Deduced a trap composed of 21 places in 399 ms of which 0 ms to minimize.
[2023-03-18 21:21:21] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:21:21] [INFO ] Deduced a trap composed of 13 places in 401 ms of which 1 ms to minimize.
[2023-03-18 21:21:22] [INFO ] Deduced a trap composed of 14 places in 390 ms of which 2 ms to minimize.
[2023-03-18 21:21:22] [INFO ] Deduced a trap composed of 22 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:21:23] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 0 ms to minimize.
[2023-03-18 21:21:23] [INFO ] Deduced a trap composed of 97 places in 372 ms of which 1 ms to minimize.
[2023-03-18 21:21:24] [INFO ] Deduced a trap composed of 40 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:21:24] [INFO ] Deduced a trap composed of 21 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:21:25] [INFO ] Deduced a trap composed of 93 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:21:25] [INFO ] Deduced a trap composed of 12 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:21:25] [INFO ] Deduced a trap composed of 35 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:21:26] [INFO ] Deduced a trap composed of 31 places in 356 ms of which 0 ms to minimize.
[2023-03-18 21:21:26] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:21:27] [INFO ] Deduced a trap composed of 70 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:21:27] [INFO ] Deduced a trap composed of 57 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:21:27] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 0 ms to minimize.
[2023-03-18 21:21:28] [INFO ] Deduced a trap composed of 40 places in 368 ms of which 0 ms to minimize.
[2023-03-18 21:21:28] [INFO ] Deduced a trap composed of 39 places in 383 ms of which 1 ms to minimize.
[2023-03-18 21:21:29] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 1 ms to minimize.
[2023-03-18 21:21:29] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 0 ms to minimize.
[2023-03-18 21:21:29] [INFO ] Deduced a trap composed of 31 places in 350 ms of which 0 ms to minimize.
[2023-03-18 21:21:30] [INFO ] Deduced a trap composed of 12 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:21:30] [INFO ] Deduced a trap composed of 14 places in 407 ms of which 1 ms to minimize.
[2023-03-18 21:21:31] [INFO ] Deduced a trap composed of 25 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:21:31] [INFO ] Deduced a trap composed of 39 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:21:32] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:21:32] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 0 ms to minimize.
[2023-03-18 21:21:32] [INFO ] Deduced a trap composed of 40 places in 311 ms of which 1 ms to minimize.
[2023-03-18 21:21:33] [INFO ] Deduced a trap composed of 55 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:21:33] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:21:34] [INFO ] Deduced a trap composed of 48 places in 319 ms of which 1 ms to minimize.
[2023-03-18 21:21:34] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:21:35] [INFO ] Deduced a trap composed of 23 places in 380 ms of which 0 ms to minimize.
[2023-03-18 21:21:35] [INFO ] Deduced a trap composed of 53 places in 349 ms of which 0 ms to minimize.
[2023-03-18 21:21:35] [INFO ] Deduced a trap composed of 31 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:21:36] [INFO ] Deduced a trap composed of 66 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:21:36] [INFO ] Deduced a trap composed of 41 places in 324 ms of which 0 ms to minimize.
[2023-03-18 21:21:37] [INFO ] Deduced a trap composed of 48 places in 274 ms of which 0 ms to minimize.
[2023-03-18 21:21:37] [INFO ] Deduced a trap composed of 49 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:21:37] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:21:38] [INFO ] Deduced a trap composed of 91 places in 266 ms of which 1 ms to minimize.
[2023-03-18 21:21:38] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:21:38] [INFO ] Deduced a trap composed of 49 places in 272 ms of which 1 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 58 places in 282 ms of which 1 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 0 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 1 ms to minimize.
[2023-03-18 21:21:39] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 1 ms to minimize.
[2023-03-18 21:21:40] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 0 ms to minimize.
[2023-03-18 21:21:40] [INFO ] Deduced a trap composed of 55 places in 383 ms of which 0 ms to minimize.
[2023-03-18 21:21:41] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:21:41] [INFO ] Deduced a trap composed of 39 places in 368 ms of which 1 ms to minimize.
[2023-03-18 21:21:42] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:21:42] [INFO ] Deduced a trap composed of 23 places in 350 ms of which 1 ms to minimize.
[2023-03-18 21:21:42] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 1 ms to minimize.
[2023-03-18 21:21:43] [INFO ] Deduced a trap composed of 58 places in 232 ms of which 1 ms to minimize.
[2023-03-18 21:21:43] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:21:43] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 1 ms to minimize.
[2023-03-18 21:21:44] [INFO ] Deduced a trap composed of 2 places in 504 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:21:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:21:44] [INFO ] After 25519ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:21:44] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:21:44] [INFO ] Invariant cache hit.
[2023-03-18 21:21:45] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-18 21:21:45] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:21:45] [INFO ] Invariant cache hit.
[2023-03-18 21:21:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:21:49] [INFO ] Implicit Places using invariants and state equation in 4392 ms returned []
Implicit Place search using SMT with State Equation took 5114 ms to find 0 implicit places.
[2023-03-18 21:21:49] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-18 21:21:49] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:21:49] [INFO ] Invariant cache hit.
[2023-03-18 21:21:50] [INFO ] Dead Transitions using invariants and state equation in 1129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6333 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 5 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 84 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-18 21:21:50] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-18 21:21:51] [INFO ] [Real]Absence check using 11 positive place invariants in 82 ms returned sat
[2023-03-18 21:21:51] [INFO ] After 339ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:21:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-18 21:21:51] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:21:51] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-18 21:21:51] [INFO ] After 316ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 435 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 337 ms.
Product exploration explored 100000 steps with 0 reset in 413 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 503 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 503 rules applied. Total rules applied 503 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 503 place count 1992 transition count 3389
Deduced a syphon composed of 902 places in 2 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 902 place count 1992 transition count 3389
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1105 place count 1789 transition count 3186
Deduced a syphon composed of 699 places in 2 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1308 place count 1789 transition count 3186
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1193 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1802 place count 1789 transition count 3186
Discarding 445 places :
Symmetric choice reduction at 1 with 445 rule applications. Total rules 2247 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Iterating global reduction 1 with 445 rules applied. Total rules applied 2692 place count 1344 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2692 rules in 1094 ms. Remains 1344 /1992 variables (removed 648) and now considering 2741/3096 (removed 355) transitions.
[2023-03-18 21:21:54] [INFO ] Redundant transitions in 380 ms returned []
[2023-03-18 21:21:54] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1344 cols
[2023-03-18 21:21:54] [INFO ] Computed 31 place invariants in 27 ms
[2023-03-18 21:21:57] [INFO ] Dead Transitions using invariants and state equation in 2828 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1344/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4350 ms. Remains : 1344/1992 places, 2741/3096 transitions.
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 85 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:21:57] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:21:57] [INFO ] Computed 31 place invariants in 10 ms
[2023-03-18 21:21:59] [INFO ] Implicit Places using invariants in 1232 ms returned []
[2023-03-18 21:21:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:21:59] [INFO ] Invariant cache hit.
[2023-03-18 21:22:00] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 2427 ms to find 0 implicit places.
[2023-03-18 21:22:00] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:00] [INFO ] Invariant cache hit.
[2023-03-18 21:22:03] [INFO ] Dead Transitions using invariants and state equation in 3145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5664 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 240882 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 91 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:22:03] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:03] [INFO ] Invariant cache hit.
[2023-03-18 21:22:05] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2023-03-18 21:22:05] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:05] [INFO ] Invariant cache hit.
[2023-03-18 21:22:06] [INFO ] Implicit Places using invariants and state equation in 1212 ms returned []
Implicit Place search using SMT with State Equation took 2379 ms to find 0 implicit places.
[2023-03-18 21:22:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:06] [INFO ] Invariant cache hit.
[2023-03-18 21:22:09] [INFO ] Dead Transitions using invariants and state equation in 3308 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5780 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s1318 1) (EQ s1817 1)), p1:(OR (EQ s1453 1) (EQ s1614 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 354 ms.
Stack based approach found an accepted trace after 160 steps with 0 reset with depth 161 and stack size 161 in 1 ms.
FORMULA Peterson-PT-7-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-12 finished in 6304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1))||(X(p3)&&p2))))'
Support contains 6 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 83 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:22:10] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:10] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] Implicit Places using invariants in 1117 ms returned []
[2023-03-18 21:22:11] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:12] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
[2023-03-18 21:22:12] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:12] [INFO ] Invariant cache hit.
[2023-03-18 21:22:15] [INFO ] Dead Transitions using invariants and state equation in 2528 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4937 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p1)), (NOT p1), true]
Running random walk in product with property : Peterson-PT-7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p3), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s1579 1) (EQ s1008 1) (EQ s1991 1)), p2:(AND (EQ s1006 1) (EQ s1989 1)), p3:(EQ s39 1), p1:(AND (EQ s1006 1) (EQ s1989 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 4 reset in 0 ms.
FORMULA Peterson-PT-7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-7-LTLFireability-13 finished in 5169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1))||G(p2))))))'
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 110 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:22:15] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:15] [INFO ] Invariant cache hit.
[2023-03-18 21:22:16] [INFO ] Implicit Places using invariants in 1297 ms returned []
[2023-03-18 21:22:16] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:16] [INFO ] Invariant cache hit.
[2023-03-18 21:22:17] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-18 21:22:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:17] [INFO ] Invariant cache hit.
[2023-03-18 21:22:21] [INFO ] Dead Transitions using invariants and state equation in 3277 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5890 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1020 1) (EQ s1979 1)), p2:(EQ s314 0), p1:(EQ s481 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 411 reset in 337 ms.
Product exploration explored 100000 steps with 440 reset in 350 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 138 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:22:22] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:22:22] [INFO ] Invariant cache hit.
[2023-03-18 21:22:22] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:22:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2023-03-18 21:22:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:22:24] [INFO ] After 1540ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:22:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:22:25] [INFO ] After 258ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:22:26] [INFO ] Deduced a trap composed of 20 places in 1534 ms of which 2 ms to minimize.
[2023-03-18 21:22:28] [INFO ] Deduced a trap composed of 66 places in 1704 ms of which 2 ms to minimize.
[2023-03-18 21:22:30] [INFO ] Deduced a trap composed of 66 places in 1745 ms of which 2 ms to minimize.
[2023-03-18 21:22:32] [INFO ] Deduced a trap composed of 55 places in 1742 ms of which 2 ms to minimize.
[2023-03-18 21:22:34] [INFO ] Deduced a trap composed of 13 places in 1540 ms of which 2 ms to minimize.
[2023-03-18 21:22:36] [INFO ] Deduced a trap composed of 21 places in 1675 ms of which 1 ms to minimize.
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 140 places in 1522 ms of which 2 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 168 places in 1467 ms of which 2 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 100 places in 1469 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 88 places in 1486 ms of which 2 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Deduced a trap composed of 101 places in 1468 ms of which 2 ms to minimize.
[2023-03-18 21:22:46] [INFO ] Deduced a trap composed of 21 places in 1617 ms of which 2 ms to minimize.
[2023-03-18 21:22:48] [INFO ] Deduced a trap composed of 55 places in 1641 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:22:48] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:22:48] [INFO ] After 25748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 274 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 520290 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :{}
Probabilistic random walk after 520290 steps, saw 76274 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:22:51] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-18 21:22:51] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-18 21:22:52] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:22:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:22:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:22:52] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:22:52] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:22:52] [INFO ] After 146ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:22:53] [INFO ] Deduced a trap composed of 24 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:22:53] [INFO ] Deduced a trap composed of 15 places in 394 ms of which 0 ms to minimize.
[2023-03-18 21:22:54] [INFO ] Deduced a trap composed of 12 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:22:54] [INFO ] Deduced a trap composed of 31 places in 406 ms of which 1 ms to minimize.
[2023-03-18 21:22:55] [INFO ] Deduced a trap composed of 13 places in 410 ms of which 1 ms to minimize.
[2023-03-18 21:22:55] [INFO ] Deduced a trap composed of 33 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:22:56] [INFO ] Deduced a trap composed of 30 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:22:56] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 0 ms to minimize.
[2023-03-18 21:22:57] [INFO ] Deduced a trap composed of 20 places in 409 ms of which 0 ms to minimize.
[2023-03-18 21:22:57] [INFO ] Deduced a trap composed of 20 places in 377 ms of which 1 ms to minimize.
[2023-03-18 21:22:57] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 0 ms to minimize.
[2023-03-18 21:22:58] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 1 ms to minimize.
[2023-03-18 21:22:58] [INFO ] Deduced a trap composed of 24 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:22:59] [INFO ] Deduced a trap composed of 21 places in 381 ms of which 1 ms to minimize.
[2023-03-18 21:22:59] [INFO ] Deduced a trap composed of 34 places in 364 ms of which 0 ms to minimize.
[2023-03-18 21:23:00] [INFO ] Deduced a trap composed of 22 places in 395 ms of which 1 ms to minimize.
[2023-03-18 21:23:00] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:23:01] [INFO ] Deduced a trap composed of 52 places in 349 ms of which 1 ms to minimize.
[2023-03-18 21:23:01] [INFO ] Deduced a trap composed of 61 places in 356 ms of which 1 ms to minimize.
[2023-03-18 21:23:01] [INFO ] Deduced a trap composed of 83 places in 351 ms of which 0 ms to minimize.
[2023-03-18 21:23:02] [INFO ] Deduced a trap composed of 31 places in 361 ms of which 0 ms to minimize.
[2023-03-18 21:23:02] [INFO ] Deduced a trap composed of 43 places in 326 ms of which 1 ms to minimize.
[2023-03-18 21:23:03] [INFO ] Deduced a trap composed of 42 places in 311 ms of which 0 ms to minimize.
[2023-03-18 21:23:03] [INFO ] Deduced a trap composed of 51 places in 326 ms of which 0 ms to minimize.
[2023-03-18 21:23:03] [INFO ] Deduced a trap composed of 42 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:23:04] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 0 ms to minimize.
[2023-03-18 21:23:04] [INFO ] Deduced a trap composed of 51 places in 366 ms of which 0 ms to minimize.
[2023-03-18 21:23:05] [INFO ] Deduced a trap composed of 12 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:23:05] [INFO ] Deduced a trap composed of 63 places in 361 ms of which 1 ms to minimize.
[2023-03-18 21:23:06] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:23:06] [INFO ] Deduced a trap composed of 51 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:23:06] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 1 ms to minimize.
[2023-03-18 21:23:07] [INFO ] Deduced a trap composed of 11 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:23:07] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:23:08] [INFO ] Deduced a trap composed of 38 places in 325 ms of which 1 ms to minimize.
[2023-03-18 21:23:08] [INFO ] Deduced a trap composed of 42 places in 324 ms of which 0 ms to minimize.
[2023-03-18 21:23:08] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 1 ms to minimize.
[2023-03-18 21:23:09] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:23:09] [INFO ] Deduced a trap composed of 51 places in 286 ms of which 1 ms to minimize.
[2023-03-18 21:23:09] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 1 ms to minimize.
[2023-03-18 21:23:10] [INFO ] Deduced a trap composed of 33 places in 361 ms of which 0 ms to minimize.
[2023-03-18 21:23:10] [INFO ] Deduced a trap composed of 42 places in 371 ms of which 1 ms to minimize.
[2023-03-18 21:23:11] [INFO ] Deduced a trap composed of 24 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:23:11] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 1 ms to minimize.
[2023-03-18 21:23:11] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 0 ms to minimize.
[2023-03-18 21:23:12] [INFO ] Deduced a trap composed of 75 places in 236 ms of which 1 ms to minimize.
[2023-03-18 21:23:12] [INFO ] Deduced a trap composed of 60 places in 232 ms of which 0 ms to minimize.
[2023-03-18 21:23:12] [INFO ] Deduced a trap composed of 60 places in 223 ms of which 0 ms to minimize.
[2023-03-18 21:23:13] [INFO ] Deduced a trap composed of 87 places in 233 ms of which 0 ms to minimize.
[2023-03-18 21:23:13] [INFO ] Deduced a trap composed of 70 places in 230 ms of which 1 ms to minimize.
[2023-03-18 21:23:13] [INFO ] Deduced a trap composed of 61 places in 249 ms of which 1 ms to minimize.
[2023-03-18 21:23:13] [INFO ] Deduced a trap composed of 74 places in 252 ms of which 1 ms to minimize.
[2023-03-18 21:23:14] [INFO ] Deduced a trap composed of 60 places in 238 ms of which 0 ms to minimize.
[2023-03-18 21:23:14] [INFO ] Deduced a trap composed of 69 places in 255 ms of which 1 ms to minimize.
[2023-03-18 21:23:14] [INFO ] Deduced a trap composed of 69 places in 235 ms of which 1 ms to minimize.
[2023-03-18 21:23:15] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 0 ms to minimize.
[2023-03-18 21:23:15] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 0 ms to minimize.
[2023-03-18 21:23:16] [INFO ] Deduced a trap composed of 75 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:23:16] [INFO ] Deduced a trap composed of 31 places in 321 ms of which 3 ms to minimize.
[2023-03-18 21:23:16] [INFO ] Deduced a trap composed of 63 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:23:17] [INFO ] Deduced a trap composed of 25 places in 312 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:23:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:23:17] [INFO ] After 25169ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 29 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:23:17] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:23:17] [INFO ] Invariant cache hit.
[2023-03-18 21:23:18] [INFO ] Implicit Places using invariants in 723 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 735 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 790 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 554544 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :{}
Probabilistic random walk after 554544 steps, saw 80088 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:23:21] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-18 21:23:21] [INFO ] Computed 24 place invariants in 9 ms
[2023-03-18 21:23:21] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:23:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-18 21:23:21] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:23:22] [INFO ] After 680ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:23:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:23:22] [INFO ] After 141ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:23:22] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:23:23] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:23:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 879 ms
[2023-03-18 21:23:23] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-18 21:23:23] [INFO ] After 1992ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:23:23] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:23:23] [INFO ] Invariant cache hit.
[2023-03-18 21:23:24] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-18 21:23:24] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:23:24] [INFO ] Invariant cache hit.
[2023-03-18 21:23:24] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:23:28] [INFO ] Implicit Places using invariants and state equation in 4787 ms returned []
Implicit Place search using SMT with State Equation took 5502 ms to find 0 implicit places.
[2023-03-18 21:23:28] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-18 21:23:28] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:23:28] [INFO ] Invariant cache hit.
[2023-03-18 21:23:30] [INFO ] Dead Transitions using invariants and state equation in 1102 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6707 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 19 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-18 21:23:30] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 21:23:30] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:23:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-18 21:23:30] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-18 21:23:30] [INFO ] After 66ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:23:30] [INFO ] After 120ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:23:30] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 376 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 84 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:23:31] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:23:31] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-18 21:23:32] [INFO ] Implicit Places using invariants in 1184 ms returned []
[2023-03-18 21:23:32] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:23:32] [INFO ] Invariant cache hit.
[2023-03-18 21:23:33] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 2309 ms to find 0 implicit places.
[2023-03-18 21:23:33] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:23:33] [INFO ] Invariant cache hit.
[2023-03-18 21:23:36] [INFO ] Dead Transitions using invariants and state equation in 2545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4945 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:23:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:23:36] [INFO ] Invariant cache hit.
[2023-03-18 21:23:36] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:23:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 25 ms returned sat
[2023-03-18 21:23:37] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:23:38] [INFO ] After 1446ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:23:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:23:39] [INFO ] After 248ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:23:40] [INFO ] Deduced a trap composed of 20 places in 1628 ms of which 2 ms to minimize.
[2023-03-18 21:23:42] [INFO ] Deduced a trap composed of 66 places in 1619 ms of which 2 ms to minimize.
[2023-03-18 21:23:44] [INFO ] Deduced a trap composed of 66 places in 1659 ms of which 2 ms to minimize.
[2023-03-18 21:23:46] [INFO ] Deduced a trap composed of 55 places in 1643 ms of which 2 ms to minimize.
[2023-03-18 21:23:48] [INFO ] Deduced a trap composed of 13 places in 1571 ms of which 2 ms to minimize.
[2023-03-18 21:23:49] [INFO ] Deduced a trap composed of 21 places in 1585 ms of which 2 ms to minimize.
[2023-03-18 21:23:51] [INFO ] Deduced a trap composed of 140 places in 1431 ms of which 2 ms to minimize.
[2023-03-18 21:23:53] [INFO ] Deduced a trap composed of 168 places in 1455 ms of which 2 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Deduced a trap composed of 100 places in 1479 ms of which 16 ms to minimize.
[2023-03-18 21:23:56] [INFO ] Deduced a trap composed of 88 places in 1466 ms of which 2 ms to minimize.
[2023-03-18 21:23:58] [INFO ] Deduced a trap composed of 101 places in 1459 ms of which 1 ms to minimize.
[2023-03-18 21:24:00] [INFO ] Deduced a trap composed of 21 places in 1602 ms of which 2 ms to minimize.
[2023-03-18 21:24:02] [INFO ] Deduced a trap composed of 55 places in 1607 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:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:24:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:24:02] [INFO ] After 25238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 0 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 242 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 595/1992 places, 1699/3096 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 555966 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555966 steps, saw 80221 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:24:05] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-18 21:24:05] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-18 21:24:05] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:24:05] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:24:05] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-18 21:24:06] [INFO ] After 447ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:24:06] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:24:06] [INFO ] After 144ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:24:06] [INFO ] Deduced a trap composed of 24 places in 383 ms of which 0 ms to minimize.
[2023-03-18 21:24:07] [INFO ] Deduced a trap composed of 15 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:24:07] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 0 ms to minimize.
[2023-03-18 21:24:08] [INFO ] Deduced a trap composed of 31 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:24:08] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:24:09] [INFO ] Deduced a trap composed of 33 places in 387 ms of which 1 ms to minimize.
[2023-03-18 21:24:09] [INFO ] Deduced a trap composed of 30 places in 399 ms of which 0 ms to minimize.
[2023-03-18 21:24:10] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:24:10] [INFO ] Deduced a trap composed of 20 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:24:10] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:24:11] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:24:11] [INFO ] Deduced a trap composed of 25 places in 400 ms of which 1 ms to minimize.
[2023-03-18 21:24:12] [INFO ] Deduced a trap composed of 24 places in 382 ms of which 0 ms to minimize.
[2023-03-18 21:24:12] [INFO ] Deduced a trap composed of 21 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:24:13] [INFO ] Deduced a trap composed of 34 places in 355 ms of which 1 ms to minimize.
[2023-03-18 21:24:13] [INFO ] Deduced a trap composed of 22 places in 393 ms of which 1 ms to minimize.
[2023-03-18 21:24:14] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:24:14] [INFO ] Deduced a trap composed of 52 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:24:14] [INFO ] Deduced a trap composed of 61 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:24:15] [INFO ] Deduced a trap composed of 83 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:24:15] [INFO ] Deduced a trap composed of 31 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:24:16] [INFO ] Deduced a trap composed of 43 places in 342 ms of which 1 ms to minimize.
[2023-03-18 21:24:16] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 1 ms to minimize.
[2023-03-18 21:24:16] [INFO ] Deduced a trap composed of 51 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:24:17] [INFO ] Deduced a trap composed of 42 places in 344 ms of which 0 ms to minimize.
[2023-03-18 21:24:17] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 0 ms to minimize.
[2023-03-18 21:24:18] [INFO ] Deduced a trap composed of 51 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:24:18] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:24:19] [INFO ] Deduced a trap composed of 63 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:24:19] [INFO ] Deduced a trap composed of 52 places in 360 ms of which 1 ms to minimize.
[2023-03-18 21:24:19] [INFO ] Deduced a trap composed of 51 places in 334 ms of which 1 ms to minimize.
[2023-03-18 21:24:20] [INFO ] Deduced a trap composed of 20 places in 330 ms of which 1 ms to minimize.
[2023-03-18 21:24:20] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 2 ms to minimize.
[2023-03-18 21:24:21] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 0 ms to minimize.
[2023-03-18 21:24:21] [INFO ] Deduced a trap composed of 38 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:24:21] [INFO ] Deduced a trap composed of 42 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:24:22] [INFO ] Deduced a trap composed of 51 places in 284 ms of which 0 ms to minimize.
[2023-03-18 21:24:22] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 0 ms to minimize.
[2023-03-18 21:24:22] [INFO ] Deduced a trap composed of 51 places in 285 ms of which 1 ms to minimize.
[2023-03-18 21:24:23] [INFO ] Deduced a trap composed of 20 places in 316 ms of which 1 ms to minimize.
[2023-03-18 21:24:23] [INFO ] Deduced a trap composed of 33 places in 372 ms of which 0 ms to minimize.
[2023-03-18 21:24:24] [INFO ] Deduced a trap composed of 42 places in 358 ms of which 0 ms to minimize.
[2023-03-18 21:24:24] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:24:25] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 1 ms to minimize.
[2023-03-18 21:24:25] [INFO ] Deduced a trap composed of 13 places in 288 ms of which 1 ms to minimize.
[2023-03-18 21:24:25] [INFO ] Deduced a trap composed of 75 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:24:25] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 1 ms to minimize.
[2023-03-18 21:24:26] [INFO ] Deduced a trap composed of 60 places in 255 ms of which 0 ms to minimize.
[2023-03-18 21:24:26] [INFO ] Deduced a trap composed of 87 places in 255 ms of which 0 ms to minimize.
[2023-03-18 21:24:26] [INFO ] Deduced a trap composed of 70 places in 247 ms of which 1 ms to minimize.
[2023-03-18 21:24:27] [INFO ] Deduced a trap composed of 61 places in 240 ms of which 1 ms to minimize.
[2023-03-18 21:24:27] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 0 ms to minimize.
[2023-03-18 21:24:27] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 1 ms to minimize.
[2023-03-18 21:24:28] [INFO ] Deduced a trap composed of 69 places in 232 ms of which 0 ms to minimize.
[2023-03-18 21:24:28] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 1 ms to minimize.
[2023-03-18 21:24:28] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 0 ms to minimize.
[2023-03-18 21:24:29] [INFO ] Deduced a trap composed of 43 places in 352 ms of which 1 ms to minimize.
[2023-03-18 21:24:29] [INFO ] Deduced a trap composed of 75 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:24:30] [INFO ] Deduced a trap composed of 31 places in 325 ms of which 1 ms to minimize.
[2023-03-18 21:24:30] [INFO ] Deduced a trap composed of 63 places in 351 ms of which 0 ms to minimize.
[2023-03-18 21:24:30] [INFO ] Deduced a trap composed of 25 places in 276 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:24:30] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:24:30] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 595 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 26 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 595/595 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 595/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 24 ms. Remains 595 /595 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:24:30] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:24:30] [INFO ] Invariant cache hit.
[2023-03-18 21:24:31] [INFO ] Implicit Places using invariants in 845 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 859 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 588/595 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 908 ms. Remains : 588/595 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 549576 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :{}
Probabilistic random walk after 549576 steps, saw 79529 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:24:34] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-18 21:24:34] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-18 21:24:34] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:24:35] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:24:35] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:24:35] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:24:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:24:35] [INFO ] After 138ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:24:36] [INFO ] Deduced a trap composed of 13 places in 362 ms of which 0 ms to minimize.
[2023-03-18 21:24:36] [INFO ] Deduced a trap composed of 12 places in 369 ms of which 0 ms to minimize.
[2023-03-18 21:24:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 883 ms
[2023-03-18 21:24:36] [INFO ] After 1069ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-18 21:24:36] [INFO ] After 1747ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 25 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 24 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:24:36] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:24:36] [INFO ] Invariant cache hit.
[2023-03-18 21:24:37] [INFO ] Implicit Places using invariants in 684 ms returned []
[2023-03-18 21:24:37] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:24:37] [INFO ] Invariant cache hit.
[2023-03-18 21:24:37] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:24:42] [INFO ] Implicit Places using invariants and state equation in 4744 ms returned []
Implicit Place search using SMT with State Equation took 5446 ms to find 0 implicit places.
[2023-03-18 21:24:42] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-18 21:24:42] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:24:42] [INFO ] Invariant cache hit.
[2023-03-18 21:24:43] [INFO ] Dead Transitions using invariants and state equation in 1095 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6631 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 1 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 22 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-18 21:24:43] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 21:24:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:24:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-18 21:24:43] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:24:43] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:24:43] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:24:43] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 252 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 379 reset in 351 ms.
Product exploration explored 100000 steps with 349 reset in 376 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 504 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 504 rules applied. Total rules applied 504 place count 1992 transition count 3096
Performed 399 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 399 Pre rules applied. Total rules applied 504 place count 1992 transition count 3390
Deduced a syphon composed of 903 places in 2 ms
Iterating global reduction 1 with 399 rules applied. Total rules applied 903 place count 1992 transition count 3390
Discarding 203 places :
Symmetric choice reduction at 1 with 203 rule applications. Total rules 1106 place count 1789 transition count 3187
Deduced a syphon composed of 700 places in 2 ms
Iterating global reduction 1 with 203 rules applied. Total rules applied 1309 place count 1789 transition count 3187
Performed 494 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1194 places in 2 ms
Iterating global reduction 1 with 494 rules applied. Total rules applied 1803 place count 1789 transition count 3187
Discarding 446 places :
Symmetric choice reduction at 1 with 446 rule applications. Total rules 2249 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Iterating global reduction 1 with 446 rules applied. Total rules applied 2695 place count 1343 transition count 2741
Deduced a syphon composed of 748 places in 2 ms
Applied a total of 2695 rules in 641 ms. Remains 1343 /1992 variables (removed 649) and now considering 2741/3096 (removed 355) transitions.
[2023-03-18 21:24:45] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-18 21:24:45] [INFO ] Flow matrix only has 2405 transitions (discarded 336 similar events)
// Phase 1: matrix 2405 rows 1343 cols
[2023-03-18 21:24:46] [INFO ] Computed 31 place invariants in 7 ms
[2023-03-18 21:24:48] [INFO ] Dead Transitions using invariants and state equation in 2147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1343/1992 places, 2741/3096 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2967 ms. Remains : 1343/1992 places, 2741/3096 transitions.
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 103 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2023-03-18 21:24:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2023-03-18 21:24:48] [INFO ] Computed 31 place invariants in 9 ms
[2023-03-18 21:24:49] [INFO ] Implicit Places using invariants in 1624 ms returned []
[2023-03-18 21:24:49] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:24:49] [INFO ] Invariant cache hit.
[2023-03-18 21:24:50] [INFO ] Implicit Places using invariants and state equation in 1102 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
[2023-03-18 21:24:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2023-03-18 21:24:51] [INFO ] Invariant cache hit.
[2023-03-18 21:24:53] [INFO ] Dead Transitions using invariants and state equation in 2583 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5439 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 158523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 2 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 1 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 132 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2023-03-18 21:24:53] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2023-03-18 21:24:53] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-18 21:24:54] [INFO ] Implicit Places using invariants in 933 ms returned [576, 577, 578, 579, 580, 590, 591]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 939 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 585/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 30 ms. Remains 585 /585 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1101 ms. Remains : 585/1992 places, 1696/3096 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : Peterson-PT-7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s453 1) (EQ s584 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 295 ms.
Stack based approach found an accepted trace after 1362 steps with 0 reset with depth 1363 and stack size 1155 in 5 ms.
FORMULA Peterson-PT-7-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-7-LTLFireability-15 finished in 1455 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((p1||(p2 U p3)))||p0)))'
Found a Lengthening insensitive property : Peterson-PT-7-LTLFireability-11
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 894 transitions
Trivial Post-agglo rules discarded 894 transitions
Performed 894 trivial Post agglomeration. Transition count delta: 894
Iterating post reduction 0 with 894 rules applied. Total rules applied 894 place count 1992 transition count 2202
Reduce places removed 894 places and 0 transitions.
Iterating post reduction 1 with 894 rules applied. Total rules applied 1788 place count 1098 transition count 2202
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 446 Pre rules applied. Total rules applied 1788 place count 1098 transition count 1756
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 2 with 892 rules applied. Total rules applied 2680 place count 652 transition count 1756
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2792 place count 596 transition count 1700
Applied a total of 2792 rules in 179 ms. Remains 596 /1992 variables (removed 1396) and now considering 1700/3096 (removed 1396) transitions.
[2023-03-18 21:24:55] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 596 cols
[2023-03-18 21:24:55] [INFO ] Computed 31 place invariants in 3 ms
[2023-03-18 21:24:56] [INFO ] Implicit Places using invariants in 716 ms returned [580, 581, 582, 583, 584, 593, 594, 595]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 728 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1700/3096 transitions.
Applied a total of 0 rules in 24 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 932 ms. Remains : 588/1992 places, 1700/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s449 0) (EQ s575 0) (EQ s521 0)), p1:(EQ s521 0), p3:(AND (EQ s555 1) (EQ s576 1)), p2:(EQ s521 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 293 ms.
Product exploration explored 100000 steps with 0 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 411 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:24:57] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-18 21:24:57] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-18 21:24:58] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-18 21:24:58] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-18 21:24:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-18 21:24:59] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-18 21:24:59] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:24:59] [INFO ] After 256ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2023-03-18 21:24:59] [INFO ] Deduced a trap composed of 48 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:25:00] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:25:00] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:25:00] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 0 ms to minimize.
[2023-03-18 21:25:01] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 1 ms to minimize.
[2023-03-18 21:25:01] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:25:02] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:25:02] [INFO ] Deduced a trap composed of 57 places in 369 ms of which 0 ms to minimize.
[2023-03-18 21:25:03] [INFO ] Deduced a trap composed of 45 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:25:03] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 0 ms to minimize.
[2023-03-18 21:25:03] [INFO ] Deduced a trap composed of 39 places in 369 ms of which 1 ms to minimize.
[2023-03-18 21:25:04] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:25:04] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 0 ms to minimize.
[2023-03-18 21:25:05] [INFO ] Deduced a trap composed of 14 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:25:05] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 0 ms to minimize.
[2023-03-18 21:25:05] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:25:06] [INFO ] Deduced a trap composed of 22 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:25:06] [INFO ] Deduced a trap composed of 41 places in 343 ms of which 1 ms to minimize.
[2023-03-18 21:25:07] [INFO ] Deduced a trap composed of 31 places in 340 ms of which 1 ms to minimize.
[2023-03-18 21:25:07] [INFO ] Deduced a trap composed of 80 places in 289 ms of which 0 ms to minimize.
[2023-03-18 21:25:08] [INFO ] Deduced a trap composed of 40 places in 378 ms of which 1 ms to minimize.
[2023-03-18 21:25:08] [INFO ] Deduced a trap composed of 24 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:25:08] [INFO ] Deduced a trap composed of 14 places in 358 ms of which 1 ms to minimize.
[2023-03-18 21:25:09] [INFO ] Deduced a trap composed of 32 places in 361 ms of which 1 ms to minimize.
[2023-03-18 21:25:09] [INFO ] Deduced a trap composed of 41 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:25:10] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:25:10] [INFO ] Deduced a trap composed of 25 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:25:11] [INFO ] Deduced a trap composed of 12 places in 325 ms of which 0 ms to minimize.
[2023-03-18 21:25:11] [INFO ] Deduced a trap composed of 22 places in 393 ms of which 0 ms to minimize.
[2023-03-18 21:25:11] [INFO ] Deduced a trap composed of 55 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:25:12] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 1 ms to minimize.
[2023-03-18 21:25:12] [INFO ] Deduced a trap composed of 39 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:25:13] [INFO ] Deduced a trap composed of 64 places in 280 ms of which 1 ms to minimize.
[2023-03-18 21:25:13] [INFO ] Deduced a trap composed of 65 places in 295 ms of which 1 ms to minimize.
[2023-03-18 21:25:13] [INFO ] Deduced a trap composed of 74 places in 286 ms of which 1 ms to minimize.
[2023-03-18 21:25:14] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 1 ms to minimize.
[2023-03-18 21:25:14] [INFO ] Deduced a trap composed of 65 places in 280 ms of which 1 ms to minimize.
[2023-03-18 21:25:14] [INFO ] Deduced a trap composed of 65 places in 292 ms of which 1 ms to minimize.
[2023-03-18 21:25:15] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 0 ms to minimize.
[2023-03-18 21:25:15] [INFO ] Deduced a trap composed of 21 places in 324 ms of which 1 ms to minimize.
[2023-03-18 21:25:15] [INFO ] Deduced a trap composed of 23 places in 329 ms of which 1 ms to minimize.
[2023-03-18 21:25:16] [INFO ] Deduced a trap composed of 75 places in 286 ms of which 0 ms to minimize.
[2023-03-18 21:25:16] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:25:17] [INFO ] Deduced a trap composed of 66 places in 393 ms of which 0 ms to minimize.
[2023-03-18 21:25:17] [INFO ] Deduced a trap composed of 54 places in 409 ms of which 1 ms to minimize.
[2023-03-18 21:25:18] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:25:18] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:25:19] [INFO ] Deduced a trap composed of 32 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:25:19] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 1 ms to minimize.
[2023-03-18 21:25:20] [INFO ] Deduced a trap composed of 49 places in 267 ms of which 0 ms to minimize.
[2023-03-18 21:25:20] [INFO ] Deduced a trap composed of 67 places in 258 ms of which 0 ms to minimize.
[2023-03-18 21:25:20] [INFO ] Deduced a trap composed of 75 places in 254 ms of which 1 ms to minimize.
[2023-03-18 21:25:21] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:25:21] [INFO ] Deduced a trap composed of 67 places in 269 ms of which 1 ms to minimize.
[2023-03-18 21:25:21] [INFO ] Deduced a trap composed of 67 places in 228 ms of which 0 ms to minimize.
[2023-03-18 21:25:22] [INFO ] Deduced a trap composed of 58 places in 315 ms of which 0 ms to minimize.
[2023-03-18 21:25:22] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 0 ms to minimize.
[2023-03-18 21:25:23] [INFO ] Deduced a trap composed of 43 places in 322 ms of which 1 ms to minimize.
[2023-03-18 21:25:23] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:25:23] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:25:23] [INFO ] After 25177ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 30 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 312714 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312714 steps, saw 53961 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:25:26] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:25:26] [INFO ] Invariant cache hit.
[2023-03-18 21:25:27] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:25:27] [INFO ] After 435ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 21:25:27] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:25:27] [INFO ] After 113ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:25:27] [INFO ] After 770ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:25:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:25:28] [INFO ] After 510ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:25:28] [INFO ] After 209ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:25:29] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 1 ms to minimize.
[2023-03-18 21:25:29] [INFO ] Deduced a trap composed of 30 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:25:29] [INFO ] Deduced a trap composed of 13 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:25:30] [INFO ] Deduced a trap composed of 14 places in 396 ms of which 0 ms to minimize.
[2023-03-18 21:25:30] [INFO ] Deduced a trap composed of 40 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:25:31] [INFO ] Deduced a trap composed of 31 places in 375 ms of which 0 ms to minimize.
[2023-03-18 21:25:31] [INFO ] Deduced a trap composed of 20 places in 361 ms of which 1 ms to minimize.
[2023-03-18 21:25:32] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 0 ms to minimize.
[2023-03-18 21:25:32] [INFO ] Deduced a trap composed of 44 places in 359 ms of which 1 ms to minimize.
[2023-03-18 21:25:32] [INFO ] Deduced a trap composed of 22 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:25:33] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 0 ms to minimize.
[2023-03-18 21:25:33] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2023-03-18 21:25:34] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 1 ms to minimize.
[2023-03-18 21:25:34] [INFO ] Deduced a trap composed of 24 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:25:35] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 1 ms to minimize.
[2023-03-18 21:25:35] [INFO ] Deduced a trap composed of 22 places in 364 ms of which 1 ms to minimize.
[2023-03-18 21:25:35] [INFO ] Deduced a trap composed of 13 places in 368 ms of which 1 ms to minimize.
[2023-03-18 21:25:36] [INFO ] Deduced a trap composed of 32 places in 347 ms of which 1 ms to minimize.
[2023-03-18 21:25:36] [INFO ] Deduced a trap composed of 41 places in 307 ms of which 1 ms to minimize.
[2023-03-18 21:25:37] [INFO ] Deduced a trap composed of 11 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:25:37] [INFO ] Deduced a trap composed of 12 places in 379 ms of which 0 ms to minimize.
[2023-03-18 21:25:38] [INFO ] Deduced a trap composed of 40 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:25:38] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 0 ms to minimize.
[2023-03-18 21:25:38] [INFO ] Deduced a trap composed of 35 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:25:39] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:25:39] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 0 ms to minimize.
[2023-03-18 21:25:40] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 1 ms to minimize.
[2023-03-18 21:25:40] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 1 ms to minimize.
[2023-03-18 21:25:40] [INFO ] Deduced a trap composed of 65 places in 277 ms of which 1 ms to minimize.
[2023-03-18 21:25:41] [INFO ] Deduced a trap composed of 48 places in 272 ms of which 1 ms to minimize.
[2023-03-18 21:25:41] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 0 ms to minimize.
[2023-03-18 21:25:41] [INFO ] Deduced a trap composed of 77 places in 253 ms of which 0 ms to minimize.
[2023-03-18 21:25:42] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 0 ms to minimize.
[2023-03-18 21:25:42] [INFO ] Deduced a trap composed of 58 places in 284 ms of which 1 ms to minimize.
[2023-03-18 21:25:42] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 0 ms to minimize.
[2023-03-18 21:25:43] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 1 ms to minimize.
[2023-03-18 21:25:43] [INFO ] Deduced a trap composed of 58 places in 286 ms of which 1 ms to minimize.
[2023-03-18 21:25:44] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 1 ms to minimize.
[2023-03-18 21:25:44] [INFO ] Deduced a trap composed of 40 places in 347 ms of which 0 ms to minimize.
[2023-03-18 21:25:44] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 0 ms to minimize.
[2023-03-18 21:25:45] [INFO ] Deduced a trap composed of 29 places in 356 ms of which 1 ms to minimize.
[2023-03-18 21:25:45] [INFO ] Deduced a trap composed of 24 places in 359 ms of which 0 ms to minimize.
[2023-03-18 21:25:46] [INFO ] Deduced a trap composed of 30 places in 356 ms of which 1 ms to minimize.
[2023-03-18 21:25:46] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 1 ms to minimize.
[2023-03-18 21:25:46] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 1 ms to minimize.
[2023-03-18 21:25:47] [INFO ] Deduced a trap composed of 55 places in 278 ms of which 0 ms to minimize.
[2023-03-18 21:25:47] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 1 ms to minimize.
[2023-03-18 21:25:48] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 0 ms to minimize.
[2023-03-18 21:25:48] [INFO ] Deduced a trap composed of 50 places in 377 ms of which 1 ms to minimize.
[2023-03-18 21:25:49] [INFO ] Deduced a trap composed of 75 places in 365 ms of which 0 ms to minimize.
[2023-03-18 21:25:49] [INFO ] Deduced a trap composed of 20 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:25:49] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 0 ms to minimize.
[2023-03-18 21:25:50] [INFO ] Deduced a trap composed of 49 places in 362 ms of which 1 ms to minimize.
[2023-03-18 21:25:50] [INFO ] Deduced a trap composed of 31 places in 315 ms of which 0 ms to minimize.
[2023-03-18 21:25:51] [INFO ] Deduced a trap composed of 41 places in 332 ms of which 1 ms to minimize.
[2023-03-18 21:25:51] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 1 ms to minimize.
[2023-03-18 21:25:52] [INFO ] Deduced a trap composed of 13 places in 366 ms of which 0 ms to minimize.
[2023-03-18 21:25:52] [INFO ] Deduced a trap composed of 40 places in 333 ms of which 1 ms to minimize.
[2023-03-18 21:25:52] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:25:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:25:52] [INFO ] After 25155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 34 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 27 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:25:52] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:25:52] [INFO ] Invariant cache hit.
[2023-03-18 21:25:53] [INFO ] Implicit Places using invariants in 652 ms returned []
[2023-03-18 21:25:53] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:25:53] [INFO ] Invariant cache hit.
[2023-03-18 21:25:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:25:57] [INFO ] Implicit Places using invariants and state equation in 4312 ms returned []
Implicit Place search using SMT with State Equation took 4995 ms to find 0 implicit places.
[2023-03-18 21:25:57] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-18 21:25:57] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:25:57] [INFO ] Invariant cache hit.
[2023-03-18 21:25:59] [INFO ] Dead Transitions using invariants and state equation in 1107 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6200 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 19 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-18 21:25:59] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-18 21:25:59] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-18 21:25:59] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:25:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-18 21:25:59] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:25:59] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-18 21:25:59] [INFO ] After 205ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p3) p2))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND (NOT p3) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 7 factoid took 495 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:26:00] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-18 21:26:00] [INFO ] Computed 23 place invariants in 3 ms
[2023-03-18 21:26:00] [INFO ] Implicit Places using invariants in 650 ms returned []
[2023-03-18 21:26:00] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:26:00] [INFO ] Invariant cache hit.
[2023-03-18 21:26:01] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:26:05] [INFO ] Implicit Places using invariants and state equation in 4252 ms returned []
Implicit Place search using SMT with State Equation took 4945 ms to find 0 implicit places.
[2023-03-18 21:26:05] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:26:05] [INFO ] Invariant cache hit.
[2023-03-18 21:26:06] [INFO ] Dead Transitions using invariants and state equation in 1115 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6103 ms. Remains : 588/588 places, 1700/1700 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 216 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:26:07] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:26:07] [INFO ] Invariant cache hit.
[2023-03-18 21:26:07] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:26:07] [INFO ] After 430ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 21:26:07] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:26:07] [INFO ] After 101ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:26:07] [INFO ] After 763ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:26:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:26:08] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:26:08] [INFO ] After 204ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:26:09] [INFO ] Deduced a trap composed of 31 places in 394 ms of which 1 ms to minimize.
[2023-03-18 21:26:09] [INFO ] Deduced a trap composed of 30 places in 385 ms of which 1 ms to minimize.
[2023-03-18 21:26:10] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-18 21:26:10] [INFO ] Deduced a trap composed of 14 places in 391 ms of which 0 ms to minimize.
[2023-03-18 21:26:10] [INFO ] Deduced a trap composed of 40 places in 358 ms of which 0 ms to minimize.
[2023-03-18 21:26:11] [INFO ] Deduced a trap composed of 31 places in 365 ms of which 1 ms to minimize.
[2023-03-18 21:26:11] [INFO ] Deduced a trap composed of 20 places in 380 ms of which 1 ms to minimize.
[2023-03-18 21:26:12] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 1 ms to minimize.
[2023-03-18 21:26:12] [INFO ] Deduced a trap composed of 44 places in 368 ms of which 1 ms to minimize.
[2023-03-18 21:26:13] [INFO ] Deduced a trap composed of 22 places in 356 ms of which 1 ms to minimize.
[2023-03-18 21:26:13] [INFO ] Deduced a trap composed of 25 places in 353 ms of which 0 ms to minimize.
[2023-03-18 21:26:13] [INFO ] Deduced a trap composed of 13 places in 379 ms of which 1 ms to minimize.
[2023-03-18 21:26:14] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:26:14] [INFO ] Deduced a trap composed of 24 places in 369 ms of which 0 ms to minimize.
[2023-03-18 21:26:15] [INFO ] Deduced a trap composed of 15 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:26:15] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 1 ms to minimize.
[2023-03-18 21:26:16] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 0 ms to minimize.
[2023-03-18 21:26:16] [INFO ] Deduced a trap composed of 32 places in 336 ms of which 0 ms to minimize.
[2023-03-18 21:26:16] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 1 ms to minimize.
[2023-03-18 21:26:17] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 1 ms to minimize.
[2023-03-18 21:26:17] [INFO ] Deduced a trap composed of 12 places in 394 ms of which 0 ms to minimize.
[2023-03-18 21:26:18] [INFO ] Deduced a trap composed of 40 places in 388 ms of which 1 ms to minimize.
[2023-03-18 21:26:18] [INFO ] Deduced a trap composed of 25 places in 343 ms of which 0 ms to minimize.
[2023-03-18 21:26:19] [INFO ] Deduced a trap composed of 35 places in 335 ms of which 1 ms to minimize.
[2023-03-18 21:26:19] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 1 ms to minimize.
[2023-03-18 21:26:19] [INFO ] Deduced a trap composed of 40 places in 319 ms of which 0 ms to minimize.
[2023-03-18 21:26:20] [INFO ] Deduced a trap composed of 55 places in 353 ms of which 1 ms to minimize.
[2023-03-18 21:26:20] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 1 ms to minimize.
[2023-03-18 21:26:21] [INFO ] Deduced a trap composed of 65 places in 278 ms of which 0 ms to minimize.
[2023-03-18 21:26:21] [INFO ] Deduced a trap composed of 48 places in 292 ms of which 0 ms to minimize.
[2023-03-18 21:26:21] [INFO ] Deduced a trap composed of 58 places in 284 ms of which 1 ms to minimize.
[2023-03-18 21:26:22] [INFO ] Deduced a trap composed of 77 places in 294 ms of which 1 ms to minimize.
[2023-03-18 21:26:22] [INFO ] Deduced a trap composed of 67 places in 271 ms of which 1 ms to minimize.
[2023-03-18 21:26:22] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 1 ms to minimize.
[2023-03-18 21:26:23] [INFO ] Deduced a trap composed of 64 places in 270 ms of which 1 ms to minimize.
[2023-03-18 21:26:23] [INFO ] Deduced a trap composed of 12 places in 318 ms of which 1 ms to minimize.
[2023-03-18 21:26:23] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 1 ms to minimize.
[2023-03-18 21:26:24] [INFO ] Deduced a trap composed of 57 places in 372 ms of which 1 ms to minimize.
[2023-03-18 21:26:24] [INFO ] Deduced a trap composed of 40 places in 341 ms of which 1 ms to minimize.
[2023-03-18 21:26:25] [INFO ] Deduced a trap composed of 22 places in 340 ms of which 1 ms to minimize.
[2023-03-18 21:26:25] [INFO ] Deduced a trap composed of 29 places in 315 ms of which 1 ms to minimize.
[2023-03-18 21:26:25] [INFO ] Deduced a trap composed of 24 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:26:26] [INFO ] Deduced a trap composed of 30 places in 370 ms of which 1 ms to minimize.
[2023-03-18 21:26:26] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 1 ms to minimize.
[2023-03-18 21:26:27] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 1 ms to minimize.
[2023-03-18 21:26:27] [INFO ] Deduced a trap composed of 55 places in 281 ms of which 0 ms to minimize.
[2023-03-18 21:26:28] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2023-03-18 21:26:28] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 0 ms to minimize.
[2023-03-18 21:26:28] [INFO ] Deduced a trap composed of 50 places in 385 ms of which 0 ms to minimize.
[2023-03-18 21:26:29] [INFO ] Deduced a trap composed of 75 places in 361 ms of which 0 ms to minimize.
[2023-03-18 21:26:29] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 0 ms to minimize.
[2023-03-18 21:26:30] [INFO ] Deduced a trap composed of 22 places in 383 ms of which 0 ms to minimize.
[2023-03-18 21:26:30] [INFO ] Deduced a trap composed of 49 places in 357 ms of which 1 ms to minimize.
[2023-03-18 21:26:31] [INFO ] Deduced a trap composed of 31 places in 309 ms of which 1 ms to minimize.
[2023-03-18 21:26:31] [INFO ] Deduced a trap composed of 41 places in 308 ms of which 0 ms to minimize.
[2023-03-18 21:26:31] [INFO ] Deduced a trap composed of 57 places in 338 ms of which 1 ms to minimize.
[2023-03-18 21:26:32] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2023-03-18 21:26:32] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 1 ms to minimize.
[2023-03-18 21:26:32] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:26:32] [INFO ] Trap strengthening (SAT) tested/added 59/59 trap constraints in 24091 ms
[2023-03-18 21:26:32] [INFO ] After 24306ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-18 21:26:32] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 34 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 588/588 places, 1700/1700 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 409581 steps, run timeout after 3001 ms. (steps per millisecond=136 ) properties seen :{}
Probabilistic random walk after 409581 steps, saw 63103 distinct states, run finished after 3001 ms. (steps per millisecond=136 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-18 21:26:36] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:26:36] [INFO ] Invariant cache hit.
[2023-03-18 21:26:36] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:26:36] [INFO ] After 426ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-18 21:26:36] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:26:36] [INFO ] After 103ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:26:36] [INFO ] After 740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:26:37] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2023-03-18 21:26:37] [INFO ] After 517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:26:37] [INFO ] After 207ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 21:26:38] [INFO ] Deduced a trap composed of 31 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:26:38] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 1 ms to minimize.
[2023-03-18 21:26:39] [INFO ] Deduced a trap composed of 13 places in 404 ms of which 1 ms to minimize.
[2023-03-18 21:26:39] [INFO ] Deduced a trap composed of 14 places in 426 ms of which 1 ms to minimize.
[2023-03-18 21:26:40] [INFO ] Deduced a trap composed of 40 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:26:40] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 1 ms to minimize.
[2023-03-18 21:26:40] [INFO ] Deduced a trap composed of 20 places in 370 ms of which 1 ms to minimize.
[2023-03-18 21:26:41] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 0 ms to minimize.
[2023-03-18 21:26:41] [INFO ] Deduced a trap composed of 44 places in 376 ms of which 0 ms to minimize.
[2023-03-18 21:26:42] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 0 ms to minimize.
[2023-03-18 21:26:42] [INFO ] Deduced a trap composed of 25 places in 366 ms of which 1 ms to minimize.
[2023-03-18 21:26:43] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2023-03-18 21:26:43] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 1 ms to minimize.
[2023-03-18 21:26:44] [INFO ] Deduced a trap composed of 24 places in 365 ms of which 0 ms to minimize.
[2023-03-18 21:26:44] [INFO ] Deduced a trap composed of 15 places in 393 ms of which 0 ms to minimize.
[2023-03-18 21:26:44] [INFO ] Deduced a trap composed of 22 places in 399 ms of which 1 ms to minimize.
[2023-03-18 21:26:45] [INFO ] Deduced a trap composed of 13 places in 384 ms of which 1 ms to minimize.
[2023-03-18 21:26:45] [INFO ] Deduced a trap composed of 32 places in 354 ms of which 1 ms to minimize.
[2023-03-18 21:26:46] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 1 ms to minimize.
[2023-03-18 21:26:46] [INFO ] Deduced a trap composed of 11 places in 403 ms of which 0 ms to minimize.
[2023-03-18 21:26:47] [INFO ] Deduced a trap composed of 12 places in 641 ms of which 1 ms to minimize.
[2023-03-18 21:26:48] [INFO ] Deduced a trap composed of 40 places in 633 ms of which 1 ms to minimize.
[2023-03-18 21:26:48] [INFO ] Deduced a trap composed of 25 places in 581 ms of which 1 ms to minimize.
[2023-03-18 21:26:49] [INFO ] Deduced a trap composed of 35 places in 582 ms of which 1 ms to minimize.
[2023-03-18 21:26:50] [INFO ] Deduced a trap composed of 23 places in 584 ms of which 1 ms to minimize.
[2023-03-18 21:26:50] [INFO ] Deduced a trap composed of 40 places in 543 ms of which 1 ms to minimize.
[2023-03-18 21:26:51] [INFO ] Deduced a trap composed of 55 places in 586 ms of which 1 ms to minimize.
[2023-03-18 21:26:52] [INFO ] Deduced a trap composed of 19 places in 569 ms of which 1 ms to minimize.
[2023-03-18 21:26:52] [INFO ] Deduced a trap composed of 65 places in 446 ms of which 1 ms to minimize.
[2023-03-18 21:26:53] [INFO ] Deduced a trap composed of 48 places in 435 ms of which 1 ms to minimize.
[2023-03-18 21:26:53] [INFO ] Deduced a trap composed of 58 places in 461 ms of which 1 ms to minimize.
[2023-03-18 21:26:54] [INFO ] Deduced a trap composed of 77 places in 487 ms of which 2 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 67 places in 493 ms of which 1 ms to minimize.
[2023-03-18 21:26:55] [INFO ] Deduced a trap composed of 58 places in 453 ms of which 1 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 64 places in 407 ms of which 1 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 12 places in 322 ms of which 0 ms to minimize.
[2023-03-18 21:26:56] [INFO ] Deduced a trap composed of 58 places in 399 ms of which 1 ms to minimize.
[2023-03-18 21:26:57] [INFO ] Deduced a trap composed of 57 places in 384 ms of which 0 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 40 places in 408 ms of which 1 ms to minimize.
[2023-03-18 21:26:58] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 1 ms to minimize.
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 29 places in 499 ms of which 1 ms to minimize.
[2023-03-18 21:26:59] [INFO ] Deduced a trap composed of 24 places in 459 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 30 places in 528 ms of which 1 ms to minimize.
[2023-03-18 21:27:00] [INFO ] Deduced a trap composed of 48 places in 481 ms of which 5 ms to minimize.
[2023-03-18 21:27:01] [INFO ] Deduced a trap composed of 55 places in 494 ms of which 1 ms to minimize.
[2023-03-18 21:27:02] [INFO ] Deduced a trap composed of 55 places in 390 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:27:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:27:02] [INFO ] After 25266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 2 ms.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 588/588 places, 1700/1700 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:27:02] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:02] [INFO ] Invariant cache hit.
[2023-03-18 21:27:03] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2023-03-18 21:27:03] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:03] [INFO ] Invariant cache hit.
[2023-03-18 21:27:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:27:08] [INFO ] Implicit Places using invariants and state equation in 5517 ms returned []
Implicit Place search using SMT with State Equation took 6664 ms to find 0 implicit places.
[2023-03-18 21:27:09] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-18 21:27:09] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:09] [INFO ] Invariant cache hit.
[2023-03-18 21:27:10] [INFO ] Dead Transitions using invariants and state equation in 1824 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8599 ms. Remains : 588/588 places, 1700/1700 transitions.
Graph (trivial) has 1287 edges and 588 vertex of which 445 / 588 are part of one of the 56 SCC in 1 ms
Free SCC test removed 389 places
Drop transitions removed 778 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1169 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 199 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 144 transition count 476
Performed 3 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 117 place count 141 transition count 471
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 23 rules applied. Total rules applied 140 place count 126 transition count 471
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 63 edges and 126 vertex of which 48 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 142 place count 84 transition count 470
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Graph (trivial) has 255 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 1 ms
Free SCC test removed 28 places
Iterating post reduction 1 with 54 rules applied. Total rules applied 196 place count 51 transition count 422
Drop transitions removed 140 transitions
Ensure Unique test removed 172 transitions
Reduce isomorphic transitions removed 312 transitions.
Iterating post reduction 2 with 312 rules applied. Total rules applied 508 place count 51 transition count 110
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 510 place count 50 transition count 109
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 514 place count 50 transition count 105
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 515 place count 50 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 516 place count 49 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 518 place count 49 transition count 104
Applied a total of 518 rules in 26 ms. Remains 49 /588 variables (removed 539) and now considering 104/1700 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 104 rows 49 cols
[2023-03-18 21:27:10] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-18 21:27:10] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 21:27:10] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:27:10] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-18 21:27:11] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:27:11] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-18 21:27:11] [INFO ] After 182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 (NOT p3) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p3))))]
Knowledge based reduction with 4 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Product exploration explored 100000 steps with 0 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 501 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), true, (NOT p3)]
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 46 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:27:13] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-18 21:27:13] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
// Phase 1: matrix 1364 rows 588 cols
[2023-03-18 21:27:13] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-18 21:27:14] [INFO ] Dead Transitions using invariants and state equation in 1353 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1462 ms. Remains : 588/588 places, 1700/1700 transitions.
Support contains 5 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1700/1700 transitions.
Applied a total of 0 rules in 14 ms. Remains 588 /588 variables (removed 0) and now considering 1700/1700 (removed 0) transitions.
[2023-03-18 21:27:14] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:14] [INFO ] Invariant cache hit.
[2023-03-18 21:27:15] [INFO ] Implicit Places using invariants in 934 ms returned []
[2023-03-18 21:27:15] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:15] [INFO ] Invariant cache hit.
[2023-03-18 21:27:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:27:20] [INFO ] Implicit Places using invariants and state equation in 5038 ms returned []
Implicit Place search using SMT with State Equation took 5973 ms to find 0 implicit places.
[2023-03-18 21:27:20] [INFO ] Flow matrix only has 1364 transitions (discarded 336 similar events)
[2023-03-18 21:27:20] [INFO ] Invariant cache hit.
[2023-03-18 21:27:22] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7842 ms. Remains : 588/588 places, 1700/1700 transitions.
Treatment of property Peterson-PT-7-LTLFireability-11 finished in 147431 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G(F(p1))||G(p2))))))'
Found a Shortening insensitive property : Peterson-PT-7-LTLFireability-14
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 895 transitions
Trivial Post-agglo rules discarded 895 transitions
Performed 895 trivial Post agglomeration. Transition count delta: 895
Iterating post reduction 0 with 895 rules applied. Total rules applied 895 place count 1992 transition count 2201
Reduce places removed 895 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 896 rules applied. Total rules applied 1791 place count 1097 transition count 2200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 446 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 446 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1754
Deduced a syphon composed of 446 places in 1 ms
Reduce places removed 446 places and 0 transitions.
Iterating global reduction 3 with 892 rules applied. Total rules applied 2684 place count 650 transition count 1754
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 3 with 110 rules applied. Total rules applied 2794 place count 595 transition count 1699
Applied a total of 2794 rules in 176 ms. Remains 595 /1992 variables (removed 1397) and now considering 1699/3096 (removed 1397) transitions.
[2023-03-18 21:27:23] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 595 cols
[2023-03-18 21:27:23] [INFO ] Computed 31 place invariants in 4 ms
[2023-03-18 21:27:24] [INFO ] Implicit Places using invariants in 1037 ms returned [579, 580, 581, 583, 592, 593, 594]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1039 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 588/1992 places, 1699/3096 transitions.
Applied a total of 0 rules in 22 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1239 ms. Remains : 588/1992 places, 1699/3096 transitions.
Running random walk in product with property : Peterson-PT-7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s464 1) (EQ s579 1)), p2:(EQ s275 0), p1:(EQ s370 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 664 reset in 325 ms.
Product exploration explored 100000 steps with 694 reset in 496 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:27:25] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-18 21:27:25] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-18 21:27:25] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:27:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 18 ms returned sat
[2023-03-18 21:27:25] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-18 21:27:26] [INFO ] After 611ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:27:26] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:27:26] [INFO ] After 133ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:27:27] [INFO ] Deduced a trap composed of 13 places in 527 ms of which 1 ms to minimize.
[2023-03-18 21:27:27] [INFO ] Deduced a trap composed of 12 places in 482 ms of which 1 ms to minimize.
[2023-03-18 21:27:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1193 ms
[2023-03-18 21:27:27] [INFO ] After 1379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-18 21:27:28] [INFO ] After 2307ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 539811 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 539811 steps, saw 78515 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:27:31] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:27:31] [INFO ] Invariant cache hit.
[2023-03-18 21:27:31] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:27:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2023-03-18 21:27:31] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:27:31] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:27:31] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:27:32] [INFO ] After 179ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:27:32] [INFO ] Deduced a trap composed of 13 places in 536 ms of which 1 ms to minimize.
[2023-03-18 21:27:33] [INFO ] Deduced a trap composed of 12 places in 674 ms of which 2 ms to minimize.
[2023-03-18 21:27:34] [INFO ] Deduced a trap composed of 33 places in 675 ms of which 1 ms to minimize.
[2023-03-18 21:27:35] [INFO ] Deduced a trap composed of 30 places in 692 ms of which 1 ms to minimize.
[2023-03-18 21:27:35] [INFO ] Deduced a trap composed of 31 places in 489 ms of which 1 ms to minimize.
[2023-03-18 21:27:36] [INFO ] Deduced a trap composed of 34 places in 670 ms of which 2 ms to minimize.
[2023-03-18 21:27:36] [INFO ] Deduced a trap composed of 24 places in 537 ms of which 1 ms to minimize.
[2023-03-18 21:27:37] [INFO ] Deduced a trap composed of 22 places in 638 ms of which 1 ms to minimize.
[2023-03-18 21:27:38] [INFO ] Deduced a trap composed of 22 places in 483 ms of which 1 ms to minimize.
[2023-03-18 21:27:38] [INFO ] Deduced a trap composed of 21 places in 421 ms of which 1 ms to minimize.
[2023-03-18 21:27:39] [INFO ] Deduced a trap composed of 12 places in 657 ms of which 1 ms to minimize.
[2023-03-18 21:27:39] [INFO ] Deduced a trap composed of 12 places in 406 ms of which 0 ms to minimize.
[2023-03-18 21:27:40] [INFO ] Deduced a trap composed of 12 places in 502 ms of which 1 ms to minimize.
[2023-03-18 21:27:41] [INFO ] Deduced a trap composed of 79 places in 587 ms of which 1 ms to minimize.
[2023-03-18 21:27:41] [INFO ] Deduced a trap composed of 60 places in 563 ms of which 1 ms to minimize.
[2023-03-18 21:27:42] [INFO ] Deduced a trap composed of 51 places in 578 ms of which 1 ms to minimize.
[2023-03-18 21:27:42] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 1 ms to minimize.
[2023-03-18 21:27:43] [INFO ] Deduced a trap composed of 30 places in 611 ms of which 1 ms to minimize.
[2023-03-18 21:27:44] [INFO ] Deduced a trap composed of 24 places in 665 ms of which 1 ms to minimize.
[2023-03-18 21:27:45] [INFO ] Deduced a trap composed of 16 places in 599 ms of which 1 ms to minimize.
[2023-03-18 21:27:46] [INFO ] Deduced a trap composed of 64 places in 634 ms of which 1 ms to minimize.
[2023-03-18 21:27:46] [INFO ] Deduced a trap composed of 15 places in 619 ms of which 1 ms to minimize.
[2023-03-18 21:27:47] [INFO ] Deduced a trap composed of 75 places in 632 ms of which 1 ms to minimize.
[2023-03-18 21:27:48] [INFO ] Deduced a trap composed of 15 places in 611 ms of which 1 ms to minimize.
[2023-03-18 21:27:48] [INFO ] Deduced a trap composed of 42 places in 578 ms of which 2 ms to minimize.
[2023-03-18 21:27:49] [INFO ] Deduced a trap composed of 31 places in 586 ms of which 1 ms to minimize.
[2023-03-18 21:27:50] [INFO ] Deduced a trap composed of 60 places in 514 ms of which 1 ms to minimize.
[2023-03-18 21:27:50] [INFO ] Deduced a trap composed of 63 places in 434 ms of which 1 ms to minimize.
[2023-03-18 21:27:50] [INFO ] Deduced a trap composed of 51 places in 424 ms of which 1 ms to minimize.
[2023-03-18 21:27:51] [INFO ] Deduced a trap composed of 43 places in 546 ms of which 1 ms to minimize.
[2023-03-18 21:27:52] [INFO ] Deduced a trap composed of 42 places in 491 ms of which 0 ms to minimize.
[2023-03-18 21:27:52] [INFO ] Deduced a trap composed of 42 places in 540 ms of which 1 ms to minimize.
[2023-03-18 21:27:53] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 0 ms to minimize.
[2023-03-18 21:27:53] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 1 ms to minimize.
[2023-03-18 21:27:54] [INFO ] Deduced a trap composed of 63 places in 374 ms of which 1 ms to minimize.
[2023-03-18 21:27:54] [INFO ] Deduced a trap composed of 65 places in 410 ms of which 0 ms to minimize.
[2023-03-18 21:27:55] [INFO ] Deduced a trap composed of 62 places in 488 ms of which 1 ms to minimize.
[2023-03-18 21:27:56] [INFO ] Deduced a trap composed of 41 places in 534 ms of which 1 ms to minimize.
[2023-03-18 21:27:56] [INFO ] Deduced a trap composed of 17 places in 600 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:27:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:27:56] [INFO ] After 25534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 46 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:27:56] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:27:56] [INFO ] Invariant cache hit.
[2023-03-18 21:27:57] [INFO ] Implicit Places using invariants in 1067 ms returned []
[2023-03-18 21:27:57] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:27:57] [INFO ] Invariant cache hit.
[2023-03-18 21:27:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:28:03] [INFO ] Implicit Places using invariants and state equation in 5541 ms returned []
Implicit Place search using SMT with State Equation took 6611 ms to find 0 implicit places.
[2023-03-18 21:28:03] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-18 21:28:03] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:28:03] [INFO ] Invariant cache hit.
[2023-03-18 21:28:05] [INFO ] Dead Transitions using invariants and state equation in 1701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8430 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 22 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-18 21:28:05] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-18 21:28:05] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-18 21:28:05] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:28:05] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:05] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-18 21:28:05] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 24 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:28:06] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-18 21:28:06] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-18 21:28:07] [INFO ] Implicit Places using invariants in 1012 ms returned []
[2023-03-18 21:28:07] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:28:07] [INFO ] Invariant cache hit.
[2023-03-18 21:28:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:28:11] [INFO ] Implicit Places using invariants and state equation in 4726 ms returned []
Implicit Place search using SMT with State Equation took 5750 ms to find 0 implicit places.
[2023-03-18 21:28:11] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:28:11] [INFO ] Invariant cache hit.
[2023-03-18 21:28:13] [INFO ] Dead Transitions using invariants and state equation in 1425 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7202 ms. Remains : 588/588 places, 1699/1699 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:28:13] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:28:13] [INFO ] Invariant cache hit.
[2023-03-18 21:28:14] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 17 ms returned sat
[2023-03-18 21:28:14] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:28:14] [INFO ] After 652ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:14] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:28:15] [INFO ] After 236ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:15] [INFO ] Deduced a trap composed of 13 places in 483 ms of which 1 ms to minimize.
[2023-03-18 21:28:16] [INFO ] Deduced a trap composed of 12 places in 657 ms of which 1 ms to minimize.
[2023-03-18 21:28:17] [INFO ] Deduced a trap composed of 33 places in 631 ms of which 1 ms to minimize.
[2023-03-18 21:28:17] [INFO ] Deduced a trap composed of 30 places in 619 ms of which 2 ms to minimize.
[2023-03-18 21:28:18] [INFO ] Deduced a trap composed of 31 places in 647 ms of which 2 ms to minimize.
[2023-03-18 21:28:19] [INFO ] Deduced a trap composed of 34 places in 664 ms of which 1 ms to minimize.
[2023-03-18 21:28:19] [INFO ] Deduced a trap composed of 24 places in 637 ms of which 1 ms to minimize.
[2023-03-18 21:28:20] [INFO ] Deduced a trap composed of 22 places in 640 ms of which 1 ms to minimize.
[2023-03-18 21:28:21] [INFO ] Deduced a trap composed of 22 places in 636 ms of which 1 ms to minimize.
[2023-03-18 21:28:22] [INFO ] Deduced a trap composed of 21 places in 643 ms of which 1 ms to minimize.
[2023-03-18 21:28:22] [INFO ] Deduced a trap composed of 12 places in 639 ms of which 1 ms to minimize.
[2023-03-18 21:28:23] [INFO ] Deduced a trap composed of 12 places in 643 ms of which 1 ms to minimize.
[2023-03-18 21:28:24] [INFO ] Deduced a trap composed of 12 places in 603 ms of which 1 ms to minimize.
[2023-03-18 21:28:24] [INFO ] Deduced a trap composed of 79 places in 606 ms of which 1 ms to minimize.
[2023-03-18 21:28:25] [INFO ] Deduced a trap composed of 60 places in 587 ms of which 1 ms to minimize.
[2023-03-18 21:28:26] [INFO ] Deduced a trap composed of 51 places in 595 ms of which 2 ms to minimize.
[2023-03-18 21:28:26] [INFO ] Deduced a trap composed of 26 places in 604 ms of which 1 ms to minimize.
[2023-03-18 21:28:27] [INFO ] Deduced a trap composed of 30 places in 587 ms of which 1 ms to minimize.
[2023-03-18 21:28:28] [INFO ] Deduced a trap composed of 24 places in 629 ms of which 1 ms to minimize.
[2023-03-18 21:28:29] [INFO ] Deduced a trap composed of 16 places in 568 ms of which 1 ms to minimize.
[2023-03-18 21:28:29] [INFO ] Deduced a trap composed of 64 places in 589 ms of which 1 ms to minimize.
[2023-03-18 21:28:30] [INFO ] Deduced a trap composed of 15 places in 573 ms of which 2 ms to minimize.
[2023-03-18 21:28:31] [INFO ] Deduced a trap composed of 75 places in 561 ms of which 1 ms to minimize.
[2023-03-18 21:28:31] [INFO ] Deduced a trap composed of 15 places in 621 ms of which 1 ms to minimize.
[2023-03-18 21:28:32] [INFO ] Deduced a trap composed of 42 places in 587 ms of which 1 ms to minimize.
[2023-03-18 21:28:33] [INFO ] Deduced a trap composed of 31 places in 584 ms of which 1 ms to minimize.
[2023-03-18 21:28:33] [INFO ] Deduced a trap composed of 60 places in 548 ms of which 1 ms to minimize.
[2023-03-18 21:28:34] [INFO ] Deduced a trap composed of 63 places in 542 ms of which 1 ms to minimize.
[2023-03-18 21:28:35] [INFO ] Deduced a trap composed of 51 places in 580 ms of which 1 ms to minimize.
[2023-03-18 21:28:35] [INFO ] Deduced a trap composed of 43 places in 488 ms of which 1 ms to minimize.
[2023-03-18 21:28:36] [INFO ] Deduced a trap composed of 42 places in 563 ms of which 1 ms to minimize.
[2023-03-18 21:28:37] [INFO ] Deduced a trap composed of 42 places in 552 ms of which 1 ms to minimize.
[2023-03-18 21:28:37] [INFO ] Deduced a trap composed of 52 places in 581 ms of which 1 ms to minimize.
[2023-03-18 21:28:38] [INFO ] Deduced a trap composed of 50 places in 592 ms of which 1 ms to minimize.
[2023-03-18 21:28:39] [INFO ] Deduced a trap composed of 63 places in 508 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:28:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:28:39] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 56 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 588/588 places, 1699/1699 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 487584 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 487584 steps, saw 68493 distinct states, run finished after 3001 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 21:28:42] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:28:42] [INFO ] Invariant cache hit.
[2023-03-18 21:28:42] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:28:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 13 ms returned sat
[2023-03-18 21:28:42] [INFO ] [Nat]Absence check using 23 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:28:43] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:43] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:28:43] [INFO ] After 177ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 21:28:43] [INFO ] Deduced a trap composed of 13 places in 498 ms of which 0 ms to minimize.
[2023-03-18 21:28:44] [INFO ] Deduced a trap composed of 12 places in 638 ms of which 1 ms to minimize.
[2023-03-18 21:28:45] [INFO ] Deduced a trap composed of 33 places in 647 ms of which 1 ms to minimize.
[2023-03-18 21:28:45] [INFO ] Deduced a trap composed of 30 places in 540 ms of which 1 ms to minimize.
[2023-03-18 21:28:46] [INFO ] Deduced a trap composed of 31 places in 645 ms of which 1 ms to minimize.
[2023-03-18 21:28:47] [INFO ] Deduced a trap composed of 34 places in 660 ms of which 1 ms to minimize.
[2023-03-18 21:28:48] [INFO ] Deduced a trap composed of 24 places in 674 ms of which 1 ms to minimize.
[2023-03-18 21:28:48] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 1 ms to minimize.
[2023-03-18 21:28:49] [INFO ] Deduced a trap composed of 22 places in 722 ms of which 1 ms to minimize.
[2023-03-18 21:28:50] [INFO ] Deduced a trap composed of 21 places in 658 ms of which 2 ms to minimize.
[2023-03-18 21:28:51] [INFO ] Deduced a trap composed of 12 places in 687 ms of which 1 ms to minimize.
[2023-03-18 21:28:51] [INFO ] Deduced a trap composed of 12 places in 695 ms of which 1 ms to minimize.
[2023-03-18 21:28:52] [INFO ] Deduced a trap composed of 12 places in 579 ms of which 1 ms to minimize.
[2023-03-18 21:28:53] [INFO ] Deduced a trap composed of 79 places in 602 ms of which 1 ms to minimize.
[2023-03-18 21:28:53] [INFO ] Deduced a trap composed of 60 places in 556 ms of which 1 ms to minimize.
[2023-03-18 21:28:54] [INFO ] Deduced a trap composed of 51 places in 557 ms of which 1 ms to minimize.
[2023-03-18 21:28:55] [INFO ] Deduced a trap composed of 26 places in 595 ms of which 1 ms to minimize.
[2023-03-18 21:28:55] [INFO ] Deduced a trap composed of 30 places in 465 ms of which 1 ms to minimize.
[2023-03-18 21:28:56] [INFO ] Deduced a trap composed of 24 places in 590 ms of which 1 ms to minimize.
[2023-03-18 21:28:57] [INFO ] Deduced a trap composed of 16 places in 650 ms of which 1 ms to minimize.
[2023-03-18 21:28:57] [INFO ] Deduced a trap composed of 64 places in 511 ms of which 1 ms to minimize.
[2023-03-18 21:28:58] [INFO ] Deduced a trap composed of 15 places in 598 ms of which 1 ms to minimize.
[2023-03-18 21:28:59] [INFO ] Deduced a trap composed of 75 places in 625 ms of which 2 ms to minimize.
[2023-03-18 21:29:00] [INFO ] Deduced a trap composed of 15 places in 617 ms of which 1 ms to minimize.
[2023-03-18 21:29:00] [INFO ] Deduced a trap composed of 42 places in 579 ms of which 1 ms to minimize.
[2023-03-18 21:29:01] [INFO ] Deduced a trap composed of 31 places in 596 ms of which 1 ms to minimize.
[2023-03-18 21:29:02] [INFO ] Deduced a trap composed of 60 places in 540 ms of which 1 ms to minimize.
[2023-03-18 21:29:02] [INFO ] Deduced a trap composed of 63 places in 499 ms of which 1 ms to minimize.
[2023-03-18 21:29:03] [INFO ] Deduced a trap composed of 51 places in 406 ms of which 1 ms to minimize.
[2023-03-18 21:29:03] [INFO ] Deduced a trap composed of 43 places in 540 ms of which 1 ms to minimize.
[2023-03-18 21:29:04] [INFO ] Deduced a trap composed of 42 places in 533 ms of which 1 ms to minimize.
[2023-03-18 21:29:04] [INFO ] Deduced a trap composed of 42 places in 468 ms of which 1 ms to minimize.
[2023-03-18 21:29:05] [INFO ] Deduced a trap composed of 52 places in 520 ms of which 1 ms to minimize.
[2023-03-18 21:29:06] [INFO ] Deduced a trap composed of 50 places in 525 ms of which 1 ms to minimize.
[2023-03-18 21:29:06] [INFO ] Deduced a trap composed of 63 places in 453 ms of which 1 ms to minimize.
[2023-03-18 21:29:07] [INFO ] Deduced a trap composed of 65 places in 488 ms of which 1 ms to minimize.
[2023-03-18 21:29:07] [INFO ] Deduced a trap composed of 62 places in 508 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:29:07] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 21:29:07] [INFO ] After 25489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 45 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 588/588 places, 1699/1699 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 44 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:29:07] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:07] [INFO ] Invariant cache hit.
[2023-03-18 21:29:08] [INFO ] Implicit Places using invariants in 983 ms returned []
[2023-03-18 21:29:08] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:08] [INFO ] Invariant cache hit.
[2023-03-18 21:29:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:29:14] [INFO ] Implicit Places using invariants and state equation in 5448 ms returned []
Implicit Place search using SMT with State Equation took 6433 ms to find 0 implicit places.
[2023-03-18 21:29:14] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-18 21:29:14] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:14] [INFO ] Invariant cache hit.
[2023-03-18 21:29:16] [INFO ] Dead Transitions using invariants and state equation in 1753 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8306 ms. Remains : 588/588 places, 1699/1699 transitions.
Graph (trivial) has 1280 edges and 588 vertex of which 446 / 588 are part of one of the 56 SCC in 0 ms
Free SCC test removed 390 places
Drop transitions removed 780 transitions
Ensure Unique test removed 390 transitions
Reduce isomorphic transitions removed 1170 transitions.
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 54 Pre rules applied. Total rules applied 1 place count 198 transition count 475
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 0 with 108 rules applied. Total rules applied 109 place count 144 transition count 475
Performed 2 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 113 place count 142 transition count 472
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 134 place count 128 transition count 465
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 135 place count 128 transition count 464
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 64 edges and 127 vertex of which 49 / 127 are part of one of the 6 SCC in 0 ms
Free SCC test removed 43 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 137 place count 84 transition count 464
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 49 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 50 transitions.
Graph (trivial) has 260 edges and 79 vertex of which 35 / 79 are part of one of the 7 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 56 rules applied. Total rules applied 193 place count 51 transition count 414
Drop transitions removed 140 transitions
Ensure Unique test removed 168 transitions
Reduce isomorphic transitions removed 308 transitions.
Iterating post reduction 3 with 308 rules applied. Total rules applied 501 place count 51 transition count 106
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 502 place count 51 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 502 place count 51 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 504 place count 50 transition count 104
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 506 place count 50 transition count 104
Applied a total of 506 rules in 22 ms. Remains 50 /588 variables (removed 538) and now considering 104/1699 (removed 1595) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 104 rows 50 cols
[2023-03-18 21:29:16] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 21:29:16] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 21:29:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-18 21:29:16] [INFO ] [Nat]Absence check using 11 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-18 21:29:16] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 21:29:16] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-18 21:29:16] [INFO ] After 124ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p0) (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 255 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 188 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 681 reset in 500 ms.
Product exploration explored 100000 steps with 660 reset in 424 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 26 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:29:18] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-18 21:29:18] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
// Phase 1: matrix 1363 rows 588 cols
[2023-03-18 21:29:18] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-18 21:29:20] [INFO ] Dead Transitions using invariants and state equation in 1836 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1903 ms. Remains : 588/588 places, 1699/1699 transitions.
Support contains 4 out of 588 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 588/588 places, 1699/1699 transitions.
Applied a total of 0 rules in 15 ms. Remains 588 /588 variables (removed 0) and now considering 1699/1699 (removed 0) transitions.
[2023-03-18 21:29:20] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:20] [INFO ] Invariant cache hit.
[2023-03-18 21:29:21] [INFO ] Implicit Places using invariants in 1167 ms returned []
[2023-03-18 21:29:21] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:21] [INFO ] Invariant cache hit.
[2023-03-18 21:29:22] [INFO ] State equation strengthened by 497 read => feed constraints.
[2023-03-18 21:29:27] [INFO ] Implicit Places using invariants and state equation in 5980 ms returned []
Implicit Place search using SMT with State Equation took 7148 ms to find 0 implicit places.
[2023-03-18 21:29:27] [INFO ] Flow matrix only has 1363 transitions (discarded 336 similar events)
[2023-03-18 21:29:27] [INFO ] Invariant cache hit.
[2023-03-18 21:29:29] [INFO ] Dead Transitions using invariants and state equation in 1796 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8962 ms. Remains : 588/588 places, 1699/1699 transitions.
Treatment of property Peterson-PT-7-LTLFireability-14 finished in 126885 ms.
[2023-03-18 21:29:29] [INFO ] Flatten gal took : 178 ms
[2023-03-18 21:29:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-18 21:29:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 43 ms.
Total runtime 861483 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5082/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/5082/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Peterson-PT-7-LTLFireability-11
Could not compute solution for formula : Peterson-PT-7-LTLFireability-14

BK_STOP 1679174974727

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Peterson-PT-7-LTLFireability-11
ltl formula formula --ltl=/tmp/5082/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1992 places, 3096 transitions and 9584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.180 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5082/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5082/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5082/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5082/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins
ltl formula name Peterson-PT-7-LTLFireability-14
ltl formula formula --ltl=/tmp/5082/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1992 places, 3096 transitions and 9584 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.150 user 0.170 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/5082/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/5082/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/5082/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/5082/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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="Peterson-PT-7"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-7, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r265-smll-167863540300644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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