About the Execution of LTSMin+red for DoubleLock-PT-p1s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1002.939 | 320033.00 | 374004.00 | 1673.50 | ?FFFFFFFFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r137-smll-167819418700516.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 DoubleLock-PT-p1s2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r137-smll-167819418700516
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 7.1K Feb 25 14:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 14:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 25 14:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Feb 25 14:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 14:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 14:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.4M Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-00
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-01
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-02
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-03
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-04
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-05
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-06
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-07
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-08
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-09
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-10
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-11
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-12
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-13
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-14
FORMULA_NAME DoubleLock-PT-p1s2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678908718127
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=DoubleLock-PT-p1s2
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-15 19:32:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 19:32:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 19:32:01] [INFO ] Load time of PNML (sax parser for PT used): 609 ms
[2023-03-15 19:32:01] [INFO ] Transformed 570 places.
[2023-03-15 19:32:01] [INFO ] Transformed 7600 transitions.
[2023-03-15 19:32:01] [INFO ] Parsed PT model containing 570 places and 7600 transitions and 30784 arcs in 869 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 132 places in 27 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s2-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 67 out of 438 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 438/438 places, 7344/7344 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 434 transition count 7344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 433 transition count 7216
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 433 transition count 7216
Applied a total of 6 rules in 239 ms. Remains 433 /438 variables (removed 5) and now considering 7216/7344 (removed 128) transitions.
[2023-03-15 19:32:02] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-15 19:32:02] [INFO ] Computed 2 place invariants in 118 ms
[2023-03-15 19:32:03] [INFO ] Implicit Places using invariants in 1043 ms returned []
[2023-03-15 19:32:03] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:32:03] [INFO ] Invariant cache hit.
[2023-03-15 19:32:04] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:32:05] [INFO ] Implicit Places using invariants and state equation in 2534 ms returned []
Implicit Place search using SMT with State Equation took 3626 ms to find 0 implicit places.
[2023-03-15 19:32:05] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:32:05] [INFO ] Invariant cache hit.
[2023-03-15 19:32:09] [INFO ] Dead Transitions using invariants and state equation in 3942 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/438 places, 7216/7344 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7812 ms. Remains : 433/438 places, 7216/7344 transitions.
Support contains 67 out of 433 places after structural reductions.
[2023-03-15 19:32:10] [INFO ] Flatten gal took : 611 ms
[2023-03-15 19:32:11] [INFO ] Flatten gal took : 351 ms
[2023-03-15 19:32:11] [INFO ] Input system was already deterministic with 7216 transitions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 43) seen :11
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-15 19:32:12] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:32:12] [INFO ] Invariant cache hit.
[2023-03-15 19:32:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:32:13] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:32:37] [INFO ] After 24375ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:25
[2023-03-15 19:32:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:32:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:33:02] [INFO ] After 24425ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :24
[2023-03-15 19:33:02] [INFO ] State equation strengthened by 400 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-15 19:33:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 19:33:02] [INFO ] After 25045ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0 real:25
Fused 29 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 772 ms.
Support contains 42 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 433 transition count 7158
Applied a total of 58 rules in 474 ms. Remains 433 /433 variables (removed 0) and now considering 7158/7216 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 477 ms. Remains : 433/433 places, 7158/7216 transitions.
Incomplete random walk after 10002 steps, including 86 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 69799 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 69799 steps, saw 54617 distinct states, run finished after 3003 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 24 properties.
[2023-03-15 19:33:07] [INFO ] Flow matrix only has 4817 transitions (discarded 2341 similar events)
// Phase 1: matrix 4817 rows 433 cols
[2023-03-15 19:33:07] [INFO ] Computed 2 place invariants in 75 ms
[2023-03-15 19:33:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:33:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:33:27] [INFO ] After 19726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-15 19:33:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:33:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:33:52] [INFO ] After 24533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-15 19:33:52] [INFO ] State equation strengthened by 400 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-15 19:33:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 19:33:52] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:24
Fused 24 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 387 ms.
Support contains 42 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7158/7158 transitions.
Applied a total of 0 rules in 252 ms. Remains 433 /433 variables (removed 0) and now considering 7158/7158 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 433/433 places, 7158/7158 transitions.
Successfully simplified 4 atomic propositions for a total of 15 simplifications.
FORMULA DoubleLock-PT-p1s2-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 2176 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' '!(G(F(((!p0||F(!p0)) U (G((!p0||F(!p0)))||(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))&&(!p0||F(!p0))))))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 424 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:33:54] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-15 19:33:54] [INFO ] Computed 2 place invariants in 42 ms
[2023-03-15 19:33:54] [INFO ] Implicit Places using invariants in 987 ms returned []
[2023-03-15 19:33:55] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:33:55] [INFO ] Invariant cache hit.
[2023-03-15 19:33:55] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:33:57] [INFO ] Implicit Places using invariants and state equation in 2855 ms returned []
Implicit Place search using SMT with State Equation took 3844 ms to find 0 implicit places.
[2023-03-15 19:33:58] [INFO ] Redundant transitions in 1103 ms returned []
[2023-03-15 19:33:58] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:33:58] [INFO ] Invariant cache hit.
[2023-03-15 19:34:02] [INFO ] Dead Transitions using invariants and state equation in 3404 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8786 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 226 ms :[p0, p0]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s125 1) (GEQ s428 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1270 reset in 1264 ms.
Product exploration explored 100000 steps with 1268 reset in 1130 ms.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122789 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122789 steps, saw 95852 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 19:34:08] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:34:08] [INFO ] Invariant cache hit.
[2023-03-15 19:34:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:34:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:34:15] [INFO ] After 6822ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 19:34:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-15 19:34:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 19:34:21] [INFO ] After 5901ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 19:34:21] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:34:30] [INFO ] After 9163ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 19:34:30] [INFO ] After 15196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 433 transition count 7088
Applied a total of 128 rules in 266 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7216 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 433/433 places, 7088/7216 transitions.
Incomplete random walk after 10000 steps, including 85 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 122541 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122541 steps, saw 95669 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 19:34:33] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
// Phase 1: matrix 4747 rows 433 cols
[2023-03-15 19:34:33] [INFO ] Computed 3 place invariants in 35 ms
[2023-03-15 19:34:33] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 19:34:38] [INFO ] After 4486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 19:34:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 19:34:43] [INFO ] After 5167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 19:34:43] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:34:52] [INFO ] After 9173ms SMT Verify possible using 400 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-15 19:34:52] [INFO ] After 14453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 232 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 433/433 places, 7088/7088 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7088/7088 transitions.
Applied a total of 0 rules in 222 ms. Remains 433 /433 variables (removed 0) and now considering 7088/7088 (removed 0) transitions.
[2023-03-15 19:34:53] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-15 19:34:53] [INFO ] Invariant cache hit.
[2023-03-15 19:34:54] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-03-15 19:34:54] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-15 19:34:54] [INFO ] Invariant cache hit.
[2023-03-15 19:34:56] [INFO ] Implicit Places using invariants and state equation in 2138 ms returned []
Implicit Place search using SMT with State Equation took 3277 ms to find 0 implicit places.
[2023-03-15 19:34:57] [INFO ] Redundant transitions in 620 ms returned []
[2023-03-15 19:34:57] [INFO ] Flow matrix only has 4747 transitions (discarded 2341 similar events)
[2023-03-15 19:34:57] [INFO ] Invariant cache hit.
[2023-03-15 19:35:02] [INFO ] Dead Transitions using invariants and state equation in 5612 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9739 ms. Remains : 433/433 places, 7088/7088 transitions.
Ensure Unique test removed 2341 transitions
Reduce isomorphic transitions removed 2341 transitions.
Iterating post reduction 0 with 2341 rules applied. Total rules applied 2341 place count 433 transition count 4747
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 2341 place count 433 transition count 4736
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2363 place count 422 transition count 4736
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 2369 place count 419 transition count 4733
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2370 place count 418 transition count 4605
Iterating global reduction 1 with 1 rules applied. Total rules applied 2371 place count 418 transition count 4605
Applied a total of 2371 rules in 282 ms. Remains 418 /433 variables (removed 15) and now considering 4605/7088 (removed 2483) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4605 rows 418 cols
[2023-03-15 19:35:03] [INFO ] Computed 3 place invariants in 34 ms
[2023-03-15 19:35:03] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 19:35:06] [INFO ] After 3437ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 19:35:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 19:35:09] [INFO ] After 2973ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 19:35:09] [INFO ] After 3188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 126 ms.
[2023-03-15 19:35:09] [INFO ] After 3409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 223 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:10] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
// Phase 1: matrix 4875 rows 433 cols
[2023-03-15 19:35:10] [INFO ] Computed 2 place invariants in 39 ms
[2023-03-15 19:35:11] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-15 19:35:11] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:11] [INFO ] Invariant cache hit.
[2023-03-15 19:35:12] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:35:13] [INFO ] Implicit Places using invariants and state equation in 2582 ms returned []
Implicit Place search using SMT with State Equation took 3396 ms to find 0 implicit places.
[2023-03-15 19:35:14] [INFO ] Redundant transitions in 1002 ms returned []
[2023-03-15 19:35:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:14] [INFO ] Invariant cache hit.
[2023-03-15 19:35:18] [INFO ] Dead Transitions using invariants and state equation in 3527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8158 ms. Remains : 433/433 places, 7216/7216 transitions.
Computed a total of 10 stabilizing places and 2176 stable transitions
Computed a total of 10 stabilizing places and 2176 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Incomplete random walk after 10003 steps, including 90 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 1) seen :0
Finished Best-First random walk after 801 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=267 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 73 ms :[p0, p0]
Stuttering acceptance computed with spot in 154 ms :[p0, p0]
Product exploration explored 100000 steps with 1273 reset in 1010 ms.
Product exploration explored 100000 steps with 1281 reset in 1033 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 216 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:21] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:21] [INFO ] Invariant cache hit.
[2023-03-15 19:35:22] [INFO ] Implicit Places using invariants in 746 ms returned []
[2023-03-15 19:35:22] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:22] [INFO ] Invariant cache hit.
[2023-03-15 19:35:23] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:35:24] [INFO ] Implicit Places using invariants and state equation in 2684 ms returned []
Implicit Place search using SMT with State Equation took 3433 ms to find 0 implicit places.
[2023-03-15 19:35:25] [INFO ] Redundant transitions in 1003 ms returned []
[2023-03-15 19:35:25] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:25] [INFO ] Invariant cache hit.
[2023-03-15 19:35:29] [INFO ] Dead Transitions using invariants and state equation in 3962 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8621 ms. Remains : 433/433 places, 7216/7216 transitions.
Treatment of property DoubleLock-PT-p1s2-LTLFireability-00 finished in 97046 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(G(p0))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 29 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:30] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:30] [INFO ] Invariant cache hit.
[2023-03-15 19:35:31] [INFO ] Implicit Places using invariants in 737 ms returned []
[2023-03-15 19:35:31] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:31] [INFO ] Invariant cache hit.
[2023-03-15 19:35:33] [INFO ] Implicit Places using invariants and state equation in 1722 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2023-03-15 19:35:33] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:33] [INFO ] Invariant cache hit.
[2023-03-15 19:35:36] [INFO ] Dead Transitions using invariants and state equation in 3291 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5789 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s370 1) (LT s405 1) (AND (GEQ s3 1) (GEQ s385 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 12459 steps with 156 reset in 140 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-03 finished in 6081 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) U p1)&&F(G(p2))))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 29 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:36] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:36] [INFO ] Invariant cache hit.
[2023-03-15 19:35:37] [INFO ] Implicit Places using invariants in 848 ms returned []
[2023-03-15 19:35:37] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:37] [INFO ] Invariant cache hit.
[2023-03-15 19:35:38] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:35:40] [INFO ] Implicit Places using invariants and state equation in 2641 ms returned []
Implicit Place search using SMT with State Equation took 3496 ms to find 0 implicit places.
[2023-03-15 19:35:40] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:40] [INFO ] Invariant cache hit.
[2023-03-15 19:35:43] [INFO ] Dead Transitions using invariants and state equation in 3581 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7109 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 284 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}, { cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s304 1) (GEQ s416 1)) (AND (GEQ s84 1) (GEQ s395 1))), p0:(AND (GEQ s84 1) (GEQ s395 1)), p2:(OR (LT s358 1) (LT s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-04 finished in 7427 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 G((G(p1) U p2)))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 28 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:44] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:44] [INFO ] Invariant cache hit.
[2023-03-15 19:35:44] [INFO ] Implicit Places using invariants in 874 ms returned []
[2023-03-15 19:35:44] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:44] [INFO ] Invariant cache hit.
[2023-03-15 19:35:45] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:35:47] [INFO ] Implicit Places using invariants and state equation in 2630 ms returned []
Implicit Place search using SMT with State Equation took 3506 ms to find 0 implicit places.
[2023-03-15 19:35:47] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:47] [INFO ] Invariant cache hit.
[2023-03-15 19:35:52] [INFO ] Dead Transitions using invariants and state equation in 4511 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8047 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 404 ms :[(NOT p2), (NOT p2), true, (NOT p1), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=1 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 7}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={1} source=7 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=8 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=8 dest: 5}, { cond=(AND p2 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s109 1) (GEQ s429 1)), p0:(AND (GEQ s50 1) (GEQ s414 1)), p1:(AND (GEQ s121 1) (GEQ s432 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-05 finished in 8484 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((p0||((G(p2)&&p1) U p3)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 216 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:35:52] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:52] [INFO ] Invariant cache hit.
[2023-03-15 19:35:53] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-15 19:35:53] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:53] [INFO ] Invariant cache hit.
[2023-03-15 19:35:54] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:35:56] [INFO ] Implicit Places using invariants and state equation in 2628 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
[2023-03-15 19:35:57] [INFO ] Redundant transitions in 997 ms returned []
[2023-03-15 19:35:57] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:35:57] [INFO ] Invariant cache hit.
[2023-03-15 19:36:01] [INFO ] Dead Transitions using invariants and state equation in 4191 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8768 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p3:(AND (GEQ s358 1) (GEQ s431 1)), p0:(AND (GEQ s112 1) (GEQ s384 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-06 finished in 8875 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((!p0||G(((p2||X(p0))&&p1)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 204 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:01] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:01] [INFO ] Invariant cache hit.
[2023-03-15 19:36:02] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-15 19:36:02] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:02] [INFO ] Invariant cache hit.
[2023-03-15 19:36:03] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:05] [INFO ] Implicit Places using invariants and state equation in 2677 ms returned []
Implicit Place search using SMT with State Equation took 3564 ms to find 0 implicit places.
[2023-03-15 19:36:06] [INFO ] Redundant transitions in 1012 ms returned []
[2023-03-15 19:36:06] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:06] [INFO ] Invariant cache hit.
[2023-03-15 19:36:10] [INFO ] Dead Transitions using invariants and state equation in 4747 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9534 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p1) p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s80 1) (GEQ s432 1)), p0:(OR (LT s244 1) (LT s413 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-07 finished in 9602 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))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:11] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:11] [INFO ] Invariant cache hit.
[2023-03-15 19:36:11] [INFO ] Implicit Places using invariants in 889 ms returned []
[2023-03-15 19:36:11] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:11] [INFO ] Invariant cache hit.
[2023-03-15 19:36:12] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:14] [INFO ] Implicit Places using invariants and state equation in 2696 ms returned []
Implicit Place search using SMT with State Equation took 3588 ms to find 0 implicit places.
[2023-03-15 19:36:14] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:14] [INFO ] Invariant cache hit.
[2023-03-15 19:36:19] [INFO ] Dead Transitions using invariants and state equation in 4589 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8211 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s323 1) (GEQ s426 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-08 finished in 8326 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((X(X(X(((G(p1) U G(p2))&&p0)))) U X(X(p1)))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 26 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:19] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:19] [INFO ] Invariant cache hit.
[2023-03-15 19:36:20] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-15 19:36:20] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:20] [INFO ] Invariant cache hit.
[2023-03-15 19:36:21] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:22] [INFO ] Implicit Places using invariants and state equation in 2689 ms returned []
Implicit Place search using SMT with State Equation took 3587 ms to find 0 implicit places.
[2023-03-15 19:36:22] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:22] [INFO ] Invariant cache hit.
[2023-03-15 19:36:27] [INFO ] Dead Transitions using invariants and state equation in 4332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7948 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s102 1) (GEQ s413 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][false, false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 2 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-09 finished in 8128 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((p0&&X(p1))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 36 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:27] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:27] [INFO ] Invariant cache hit.
[2023-03-15 19:36:28] [INFO ] Implicit Places using invariants in 885 ms returned []
[2023-03-15 19:36:28] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:28] [INFO ] Invariant cache hit.
[2023-03-15 19:36:29] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:31] [INFO ] Implicit Places using invariants and state equation in 2690 ms returned []
Implicit Place search using SMT with State Equation took 3577 ms to find 0 implicit places.
[2023-03-15 19:36:31] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:31] [INFO ] Invariant cache hit.
[2023-03-15 19:36:34] [INFO ] Dead Transitions using invariants and state equation in 3527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7143 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s96 1) (GEQ s420 1)) (AND (GEQ s286 1) (GEQ s396 1))), p1:(OR (LT s286 1) (LT s396 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-10 finished in 7246 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)||(F(p1)&&((F(p3)&&p2) U X(G(p4))))))'
Support contains 8 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 25 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:34] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:34] [INFO ] Invariant cache hit.
[2023-03-15 19:36:35] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-15 19:36:35] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:35] [INFO ] Invariant cache hit.
[2023-03-15 19:36:36] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:37] [INFO ] Implicit Places using invariants and state equation in 2377 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
[2023-03-15 19:36:37] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:37] [INFO ] Invariant cache hit.
[2023-03-15 19:36:41] [INFO ] Dead Transitions using invariants and state equation in 3337 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6462 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4))), (NOT p1), (NOT p4), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p0)), (AND (NOT p4) (NOT p0)), (AND (NOT p3) (NOT p4) (NOT p0)), (AND (NOT p0) (NOT p4)), true, (NOT p3), (NOT p0), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=0 dest: 7}, { cond=(AND p0 p2), acceptance={} source=0 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p4, acceptance={} source=2 dest: 2}, { cond=(NOT p4), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p3) p4), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p4)), acceptance={} source=3 dest: 10}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p4), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p4)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p4), acceptance={} source=6 dest: 2}, { cond=(AND p0 p4), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p4)), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p4)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3) p4), acceptance={} source=7 dest: 3}, { cond=(AND p0 (NOT p3) p4), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p0) (NOT p3) (NOT p4)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p3) (NOT p4)), acceptance={} source=7 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p2 (NOT p3)), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}], [{ cond=true, acceptance={0} source=9 dest: 9}], [{ cond=(NOT p3), acceptance={0} source=10 dest: 10}], [{ cond=(NOT p0), acceptance={} source=11 dest: 9}, { cond=p0, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=12 dest: 10}, { cond=(AND p0 (NOT p3)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p0:(AND (GEQ s362 1) (GEQ s398 1)), p1:(OR (LT s290 1) (LT s406 1)), p2:(AND (GEQ s362 1) (GEQ s398 1)), p3:(AND (GEQ s85 1) (GEQ s428 1)), p4:(AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-11 finished in 7015 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))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 198 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:41] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:41] [INFO ] Invariant cache hit.
[2023-03-15 19:36:42] [INFO ] Implicit Places using invariants in 790 ms returned []
[2023-03-15 19:36:42] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:42] [INFO ] Invariant cache hit.
[2023-03-15 19:36:43] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:45] [INFO ] Implicit Places using invariants and state equation in 2396 ms returned []
Implicit Place search using SMT with State Equation took 3188 ms to find 0 implicit places.
[2023-03-15 19:36:46] [INFO ] Redundant transitions in 936 ms returned []
[2023-03-15 19:36:46] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:46] [INFO ] Invariant cache hit.
[2023-03-15 19:36:49] [INFO ] Dead Transitions using invariants and state equation in 3253 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7582 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s403 1) (AND (GEQ s1 1) (GEQ s429 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1253 reset in 1049 ms.
Entered a terminal (fully accepting) state of product in 10185 steps with 126 reset in 116 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-12 finished in 8820 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||X(F(p1)))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:50] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:50] [INFO ] Invariant cache hit.
[2023-03-15 19:36:51] [INFO ] Implicit Places using invariants in 792 ms returned []
[2023-03-15 19:36:51] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:51] [INFO ] Invariant cache hit.
[2023-03-15 19:36:52] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:36:54] [INFO ] Implicit Places using invariants and state equation in 2648 ms returned []
Implicit Place search using SMT with State Equation took 3442 ms to find 0 implicit places.
[2023-03-15 19:36:54] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:54] [INFO ] Invariant cache hit.
[2023-03-15 19:36:57] [INFO ] Dead Transitions using invariants and state equation in 3638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7111 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s336 1) (GEQ s409 1)), p1:(OR (AND (GEQ s336 1) (GEQ s409 1)) (AND (GEQ s52 1) (GEQ s392 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][false, false, false]]
Stuttering criterion allowed to conclude after 87 steps with 1 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-13 finished in 7249 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)) U (G((G(p2) U p1))||G(!p3))))'
Support contains 8 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:36:57] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:57] [INFO ] Invariant cache hit.
[2023-03-15 19:36:58] [INFO ] Implicit Places using invariants in 948 ms returned []
[2023-03-15 19:36:58] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:36:58] [INFO ] Invariant cache hit.
[2023-03-15 19:36:59] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:37:01] [INFO ] Implicit Places using invariants and state equation in 2744 ms returned []
Implicit Place search using SMT with State Equation took 3695 ms to find 0 implicit places.
[2023-03-15 19:37:01] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:37:01] [INFO ] Invariant cache hit.
[2023-03-15 19:37:05] [INFO ] Dead Transitions using invariants and state equation in 4338 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8061 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 974 ms :[(AND (NOT p1) p3), (NOT p1), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) p2 p3)), (AND (NOT p1) p3 (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) (NOT p1) p3), (AND (NOT p1) p3), (AND (NOT p0) (NOT p1) p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), true, p3, (NOT p2), (AND p3 (NOT p2)), (NOT p1), (AND p2 (NOT p1) p3 p0), (NOT p1), (AND p0 (NOT p1) p3)]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=0 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=0 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=0 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 1, 2} source=0 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={} source=0 dest: 7}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=0 dest: 9}, { cond=(OR (AND p1 p3) (AND p2 p3)), acceptance={} source=0 dest: 10}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 11}], [{ cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=3 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=3 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=3 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=3 dest: 14}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p1 (NOT p2) p3), acceptance={0, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2 p3), acceptance={2} source=4 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p3), acceptance={} source=4 dest: 8}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 14}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=5 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) p2 p3), acceptance={1, 2} source=6 dest: 4}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) p3 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 14}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=7 dest: 17}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=7 dest: 18}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=8 dest: 13}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0, 1, 2} source=9 dest: 9}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=9 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=9 dest: 15}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=10 dest: 9}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=10 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=10 dest: 17}], [{ cond=true, acceptance={0, 1, 2} source=11 dest: 11}], [{ cond=p3, acceptance={} source=12 dest: 11}, { cond=(NOT p3), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 11}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p2) p3), acceptance={} source=14 dest: 11}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=14 dest: 12}, { cond=(AND p2 p3), acceptance={} source=14 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=15 dest: 13}, { cond=(AND (NOT p1) p2), acceptance={0, 1, 2} source=15 dest: 15}], [{ cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=16 dest: 15}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=17 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=17 dest: 13}, { cond=(AND (NOT p1) p2), acceptance={} source=17 dest: 15}, { cond=(OR p1 p2), acceptance={} source=17 dest: 17}], [{ cond=(AND (NOT p1) (NOT p2) p3 p0), acceptance={} source=18 dest: 11}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=18 dest: 12}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=18 dest: 13}, { cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=18 dest: 14}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={} source=18 dest: 15}, { cond=(OR (AND p1 p3) (AND p2 p3 p0)), acceptance={} source=18 dest: 17}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3) p0)), acceptance={} source=18 dest: 18}]], initial=0, aps=[p1:(AND (GEQ s350 1) (GEQ s415 1)), p3:(AND (GEQ s6 1) (GEQ s384 1)), p2:(AND (GEQ s112 1) (GEQ s403 1)), p0:(AND (GEQ s60 1) (GEQ s424 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-14 finished in 9085 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||X(G((p1||X(p2))))))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 7216/7216 transitions.
Applied a total of 0 rules in 27 ms. Remains 433 /433 variables (removed 0) and now considering 7216/7216 (removed 0) transitions.
[2023-03-15 19:37:06] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:37:06] [INFO ] Invariant cache hit.
[2023-03-15 19:37:07] [INFO ] Implicit Places using invariants in 871 ms returned []
[2023-03-15 19:37:07] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:37:07] [INFO ] Invariant cache hit.
[2023-03-15 19:37:08] [INFO ] State equation strengthened by 400 read => feed constraints.
[2023-03-15 19:37:10] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned []
Implicit Place search using SMT with State Equation took 3577 ms to find 0 implicit places.
[2023-03-15 19:37:10] [INFO ] Flow matrix only has 4875 transitions (discarded 2341 similar events)
[2023-03-15 19:37:10] [INFO ] Invariant cache hit.
[2023-03-15 19:37:14] [INFO ] Dead Transitions using invariants and state equation in 4368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7973 ms. Remains : 433/433 places, 7216/7216 transitions.
Stuttering acceptance computed with spot in 206 ms :[true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleLock-PT-p1s2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=3, aps=[p0:(AND (GEQ s69 1) (GEQ s404 1)), p2:(AND (GEQ s86 1) (GEQ s425 1)), p1:(AND (GEQ s106 1) (GEQ s430 1) (GEQ s69 1) (GEQ s404 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DoubleLock-PT-p1s2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleLock-PT-p1s2-LTLFireability-15 finished in 8206 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(((!p0||F(!p0)) U (G((!p0||F(!p0)))||(((!p1 U (p2||G(!p1))) U ((!p3&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1))))))&&(!p0||F(!p0))))))))'
[2023-03-15 19:37:15] [INFO ] Flatten gal took : 257 ms
[2023-03-15 19:37:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-15 19:37:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 7216 transitions and 28864 arcs took 60 ms.
Total runtime 314788 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1150/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DoubleLock-PT-p1s2-LTLFireability-00
BK_STOP 1678909038160
--------------------
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 DoubleLock-PT-p1s2-LTLFireability-00
ltl formula formula --ltl=/tmp/1150/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 433 places, 7216 transitions and 28864 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.750 real 0.230 user 0.230 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1150/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1150/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1150/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1150/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 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:
0: pnml2lts-mc(+0xa23f4) [0x55ec490b03f4]
1: pnml2lts-mc(+0xa2496) [0x55ec490b0496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fbffa332140]
3: pnml2lts-mc(+0x405be5) [0x55ec49413be5]
4: pnml2lts-mc(+0x16b3f9) [0x55ec491793f9]
5: pnml2lts-mc(+0x164ac4) [0x55ec49172ac4]
6: pnml2lts-mc(+0x272e0a) [0x55ec49280e0a]
7: pnml2lts-mc(+0xb61f0) [0x55ec490c41f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fbffa1854d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fbffa18567a]
10: pnml2lts-mc(+0xa1581) [0x55ec490af581]
11: pnml2lts-mc(+0xa1910) [0x55ec490af910]
12: pnml2lts-mc(+0xa32a2) [0x55ec490b12a2]
13: pnml2lts-mc(+0xa50f4) [0x55ec490b30f4]
14: pnml2lts-mc(+0x3f34b3) [0x55ec494014b3]
15: pnml2lts-mc(+0x7c63d) [0x55ec4908a63d]
16: pnml2lts-mc(+0x67d86) [0x55ec49075d86]
17: pnml2lts-mc(+0x60a8a) [0x55ec4906ea8a]
18: pnml2lts-mc(+0x5eb15) [0x55ec4906cb15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fbffa16dd0a]
20: pnml2lts-mc(+0x6075e) [0x55ec4906e75e]
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="DoubleLock-PT-p1s2"
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 DoubleLock-PT-p1s2, 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 r137-smll-167819418700516"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s2.tgz
mv DoubleLock-PT-p1s2 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 '
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 ;